OFFSET
1,3
COMMENTS
From the Fibonachos link: "Two people are sharing a plate of nachos. They take turns dividing the nachos, each taking the n-th Fibonacci number of nachos on the n-th turn. When the number of nachos left is less than the next Fibonacci number, they start the sequence over. What number of nachos (less than 500) requires the most number of restarts? How would you generate numbers of nachos with a high number of restarts?"
Ones appear at indices in A000071.
Also the number of iterations of A066628(n + 1) required to reach 0.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Reddit user Teblefer, Fibonachos
EXAMPLE
a(1) = 1 via [[1]];
a(2) = 1 via [[1, 1]];
a(3) = 2 via [[1, 1], [1]];
a(4) = 1 via [[1, 1, 2]];
a(5) = 2 via [[1, 1, 2], [1]];
a(6) = 2 via [[1, 1, 2], [1, 1]];
a(7) = 1 via [[1, 1, 2, 3]];
a(8) = 2 via [[1, 1, 2, 3], [1]];
a(9) = 2 via [[1, 1, 2, 3], [1, 1]];
a(10) = 3 via [[1, 1, 2, 3], [1, 1], [1]];
An example of counting iterations of A066628(n + 1) to reach zero:
MAPLE
A280521 := proc(n)
local a, nres, i ;
a := 0 ;
nres := n;
while nres > 0 do
for i from 1 do
if A000071(i) > nres then
break;
end if;
end do:
nres := nres-A000071(i-1) ;
a := a+1 ;
end do:
a ;
end proc:
seq(A280521(n), n=1..80) ; # R. J. Mathar, Mar 05 2017
PROG
(PARI) a(n)=my(s); while(n, my(k, t); while((t=fibonacci(k++))<=n, n-=t); s++); s \\ Charles R Greathouse IV, Jan 04 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Kagey, Jan 04 2017
STATUS
approved