**82 fibonacci questions.**

You are probably familiar with the Fibonacci sequence where the first two terms are 0, 1 (or sometimes 1, 1) and every term after that is the sum of the previous two. It starts like this:
0, 1, 1, 2, ...

The Fibonacci sequence is a fairly well known thing around here. Heck, it even has its own tag. However, for all that, we sure like to stick to our roots of 1, 1, ... (or is it 0, 1, ...? We may never ...

The Fibonacci sequence is a sequence of numbers, where every number in the sequence is the sum of the two numbers preceding it. The first two numbers in the sequence are both 1.
Here are the first ...

The famous Fibonacci sequence is F(0) = 0; F(1) = 1; F(N+1) = F(N) + F(N-1) (for this challenge we are beginning with 0).
Your challenge: Given n, output the sum of all the dth Fibonacci numbers for ...

Challenge
You need to generate a program or function that takes in a positive integer N, calculates the first N terms of the Fibonacci sequence in binary, concatenates it into a single binary number, ...

There have been a billion iterations of Fibonacci challenges on this website, so lets spice things up with a Fibonacci challenge of a billion iterations!
Your challenge is to output the first 1000 ...

Winner
CJam, 74 bytes by Optimizer
Task
Take an input of an integer n through the console or a file.
Find the sum of the nth prime, square, triangular number, and cube. Add to that the factorial of ...

Seeing as there have been an awful lot of normal Fibonacci challenges, I decided that it might be interesting to calculate the Reciprocal Fibonacci constant - namely, the sum of the reciprocals of the ...

Background
The Fibonacci tiling is a tiling of the (1D) line using two segments: a short one, S, and a long one, L (their length ratio is the golden ratio, but that's not relevant to this challenge). ...

Write some code that takes a single non-negative integer n and outputs the nth power of Phi (ϕ, the Golden Ratio, approximately 1.61803398874989) with the same number of decimal digits as the nth ...

(Inspired by ASCII's 95 Characters...95 Movie Quotes)
The Challenge
Given input n, output the nth Fibonacci number. You can use either 0 or 1 indexing, please state which in your submission. ...

Fibonacci Numbers
Fibonacci Numbers start with f(1) = 1 and f(2) = 1 (some includes f(0) = 0 but this is irrelevant to this challenge. Then, for n > 2, f(n) = f(n-1) + f(n-2).
The challenge
Your ...

We are all familiar with the famous Fibonacci sequence, that starts with 0 and 1, and each element is the sum of the previous two. Here are the first few terms (OEIS A000045):
0, 1, 1, 2, 3, 5, 8, 13,...

The Challenge
Given a number, find the sum of the non-composite numbers in the Fibonacci sequence up to that number, and find the prime factors of the sum.
For example, if you were given 8, the non-...

Your Task:
Write a program or function to check if a number that is inputted is a Fibonacci number. A Fibonacci number is a number contained in the Fibonacci sequence.
The Fibonacci Sequence is ...

Definition
Fibonacci sequence F(n), on the positive integers, are defined as such:
1. F(1) = 1
2. F(2) = 1
3. F(n) = F(n-1) + F(n-2), where n is an integer and n > 2
The Fibonacci-orial of a ...

This challenge is based upon three sequences, below are their formulae:
Recamán's sequence:
a1 = 0; for n > 0, an = an-1 - n
if positive and not already in the sequence, otherwise
...

Fibonacci + FizzBuzz = Fibo Nacci!
Your challenge is to create a Fibo Nacci program!
A Fibo Nacci program outputs the first 100 Fibonacci numbers (starting from 1).
If the Fibonacci number is ...

Inspired by this Math.SE question.
Background
The Fibonacci Sequence (called F) is the sequence, starting 0, 1 such that each number (F(n)) (after the first two) is the sum of the two before it (F(n)...

For each row and then column of a matrix, we can add an extra entry with the sum of the last two entries in that row or column. For example with the following input matrix:
[ 1 1 1 ]
[ 2 3 4 ]
The ...

There is a well known question here that asks for a short (least characters) fibonacci sequence generator.
I would like to know if someone can generate the first N elements only, of the fibonacci ...

Your task is to find the nth Fibonacci number, but n is not necessarily an integer.
The Fibonacci sequence, 0-indexed, goes as follows:
0, 1, 2, 3, 4, 5, 6, 7, ...
1, 1, 2, 3, 5, 8, 13, 21, ...
...

Challenge
You must write a program that takes a positive integer n as input, and outputs the nth Fibonacci number (shortened as Fib# throughout) that contains the nth Fib# as a subtring. For the ...

Now, we all know most languages have very simple ways to "self-modify" code.
However, what if you were to actually modify the code and edit parts of it...on disk?
Your goal is to make code that ...

For this code golf, you will receive an input of a fibonacci sequence, that is, a normal Fibonacci sequence but with one number incorrect. See, the sequence is fibbing! Get it? :D
Your job is to find ...

Given a positive integer input N, output the two non-negative numbers, a and b, where a < b, with the lowest possible mean value that will result in the number N being part of the recurring ...

Your program should output exactly: Hello world!!! with or without linefeed after.
Your program should take no input.
Sourcecode character distribution must be correct according to:
The number of ...

If we define a Fibonacci-like sequence as fk(n) = (fk(n-1) + fk(n-2)) % k, for some integer k (where % is the modulo operator), the sequence will necessarily be cyclic, because there are only k2 ...

This isn't very widely known, but what we call the Fibonacci sequence, AKA
1, 1, 2, 3, 5, 8, 13, 21, 34...
is actually called the Duonacci sequence. This is because to get the next number, you sum ...

Background
We all know the famous Fibonacci sequence, where each term is the sum of the previous two, with the first term being 0 and the second one being 1. The first few elements are:
0, 1, 1, 2, ...

(inspired by Helka's response to my random pairing of "chess" and "Fibonacci" tags in chat)
Fibonacci
The Fibonacci numbers are one of the more well-known sequences in mathematics, where each number ...

Your task
You must write a program, to print a reverse Fibonacci series, given a number.
Input
A non-negative integer N.
Output
You must output all the Fibonacci numbers from Fk to F0, where k is ...

The Challenge
Given an integer input, return the first Fibonacci number that contains the input within itself along with the index of that Fibonacci number (indexes starting at 0 or 1 - up to you, ...

The Fibtraction sequence (as I call it) is similar to the Fibonacci sequence except, instead of adding numbers, you subtract them.
The first few numbers of this challenge are:
1, 2, -1, 3, -4, 7, -...

A man from the stars has come to Earth! Luckily the president of the United States, Donald Trump, has an infinity-sided die. Using this die, he can conjure up a number which you, the mayor of Podunk, ...

You should have heard about the Fibonacci Numbers, often called the Fibonacci Sequence. In this sequence the first two terms are 0 and 1, and every number after the first two is the sum of the two ...

The Fibonacci sequence is a well know sequence in which each entry is the sum of the previous two and the first two entries are 1. If we take the modulo of each term by a constant the sequence will ...

Divinacci (OEIS)
Perform the Fibonacci sequence but instead of using:
f(n) = f(n-1)+f(n-2)
Use:
f(n) = sum(divisors(f(n-1))) + sum(divisors(f(n-2)))
For an input of n, output the nth term, your ...

The N-bonacci sequence, originally invented by @DJMcMayhem in this question, is a sequence generated by starting with the integers 0 and 1, and then adding the previous N numbers to generate the next ...

Introduction
We all know and love our Fibonacci sequence and have seen a myriad of challenge on it here already. However, we're still lacking a very simple case which this answer is going to provide: ...

Write a program or named function that will output or return the sequence up to the nth integer in the Iccanobif sequence, documented on OEIS as A014258. Note that only the zeroth element in the ...

I found this task here.
Given the ith (1<=i<=35) Fibonacci
number F(i) calculate the sum of the
ith till i+9th number
F(i)+F(i+1)+...+F(i+9) and the last
digit of the i+246th one F(i+...

As the title suggests, my task is fairly straightforward:
Write a program in your language of choice that will print out the first 20 Fibonacci numbers using the least unique characters.
For example ...

We are all familiar with the Fibonacci sequence:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765
However, instead of, f(n) = f(n-1) + f(n-2) we'll be taking ...

A Quine is a program which outputs its source when run.
In this challenge, You should make a Fibonacci-quine, a variant of the quine.
What is a Fibonacci-quine?
A Fibonacci-quine is a program, ...

For this challenge, you are to output the result of the sum of some numbers. What are these numbers? Well, you are given input, (a, b), which are integers (positive, negative, or zero) , a != b, and a ...

Given three numbers m,n and p, your task is to print a list/array of length p starting with m and n and each element after p represents the difference of the 2 numbers before it, m-n (Counter-...

You've probably heard of the Fibonacci numbers; they're pretty famous. Each number in the Fibonacci sequence is the sum of the last two in the sequence with the first and second numbers being 1. The ...

If you look at the Fibonacci Numbers, you will notice a pattern in their parity: 0, 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144. Every third number is even, and all the others are odd. This ...

Definition
The Alternating Power Fibonacci Sequence is formed as follows.
Start with the empty sequence and set n to 1.
Compute fn, the nth non-negative Fibonacci number, with repetitions.
0 is the ...

- code-golf
- sequence
- number
- math
- number-theory
- kolmogorov-complexity
- primes
- quine
- ascii-art
- arithmetic
- restricted-source
- subsequence
- string
- code-challenge
- decision-problem
- integer
- base-conversion
- division
- integer-partitions
- array-manipulation
- graphical-output
- random
- combinatorics
- parsing
- binary

- How can I avoid coming across as condescending when telling a coworker I can't work on an issue right now?
- Is it illegal to order food and then not pay for it when it arrives?
- Is there another meaning for the phrasal verb “jerk off,” besides “masturbate”?
- "5 = 1€" for souvenirs in Paris, why do they write the price this way?
- how specific must rocker switch specs be?
- Unexpected behaviour of \only
- Benefit of using Vector2 data type over separate x & y variables
- Why is slip necessary in an Induction motor?
- Do I need a visa to leave Zurich airport while in transit
- Why are unit tests failing seen as bad?
- Why do we only use Soyuz to send humans to the ISS?
- Does the GDPR entitle me to refuse showing my boarding pass at EU airports shops?
- When using wish to replicate a spell, what school of magic does it count as?
- How to Differentiate Between Demonic Possession and Mental Illness
- Please tell me the way to match the size of ()
- Encrypting RNG output
- Can knowing too much about the tested code be a disadvantage?
- Do both versions (invariant and primary) of the Fundamental Theorem for Finitely Generated Abelian Groups hold at the same time?
- Sort a string by a given ordering
- How to locate and display a file
- How can one reflect the vertical axis and add a label for the vertical axis to reflect units when using DistributionChart?
- Can low-frequency electromagnetic radiation be ionizing?
- How can I decline someone's business card with tact?
- What are the Pros and Cons of long names?