|
|
A105565
|
|
a(n) = if (exactly 5 Fibonacci numbers exist with exactly n digits) then 1, otherwise 0.
|
|
4
|
|
|
0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sequence is almost periodic, see also A105566;
|
|
LINKS
|
|
|
MAPLE
|
n:= 1: count:= 2: a:= 0: b:= 1:
for m from 2 while n < 101 do
c:= b; b:= a+b; a:= c;
s:= ilog10(b)+1;
if s = n then count:= count+1
else
if count = 5 then A[n]:= 1 else A[n]:= 0 fi;
count:= 1; n:= s
fi
od:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|