|
Search: id:A010056
|
|
|
| A010056 |
|
a(n) = 1 if n is a Fibonacci number, otherwise 0. |
|
+0
8
|
|
| 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Understood as a binary number, sum(k>=0, a(k)/2^k), the resulting decimal expansion is 1.910278797207865891... = Fibonacci_binary+0.5 (see A084119) or Fibonacci_binary_constant-0.5 (see A124091), respectively. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 14 2007
a(n)=1 if and only if there is an integer m such that x=n is a root of p(x)=25*x^4-10*m^2*x^2+m^4-16. Also a(n)=1 iff floor(s)<>floor(c) or ceiling(s)<>ceiling(c) where s=arsinh(sqr(5)*n/2)/ln(phi), c=arcosh(sqr(5)*n/2)/ln(phi) and phi=(1+sqr(5))/2. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 17 2007
|
|
LINKS
|
D. Bailey et al., On the binary expansions of algebraic numbers
|
|
FORMULA
|
G.f.: g(x)=sum{k>=0, x^Fib/k)}-x. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 17 2007
|
|
CROSSREFS
|
Cf. A000045, A084119, A124091.
Cf. A104162, A108852, A130233, A130234.
Decimal expansion of Fibonacci binary is in A084119.
Sequence in context: A055132 A128408 A121802 this_sequence A115952 A115524 A117198
Adjacent sequences: A010053 A010054 A010055 this_sequence A010057 A010058 A010059
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
