id:A105563 - OEIS Search Results

Search: id:A105563

Displaying 1-1 of 1 results found.

page 1

a(n) = if (exactly 4 Fibonacci numbers exist with exactly n digits) then 1 else 0.

+0
4

0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`The sequence is almost periodic, see also A105564;` `a(n) = 1 - A105565(n) for n>1.`
	REFERENCES	`Juergen Spilker, Die Ziffern der Fibonacci-Zahlen, Elemente der Mathematik 58 (Birkhaeuser 2003).`
	LINKS	`Eric Weisstein's World of Mathematics, Fibonacci Number` `Eric Weisstein's World of Mathematics, Almost Periodic Function`
	CROSSREFS	`Cf. A050815, A060384, A000045.` `Adjacent sequences: A105560 A105561 A105562 this_sequence A105564 A105565 A105566` `Sequence in context: A024889 A101349 A111900 this_sequence A011765 A129251 A023969`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 14 2005`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research