A105565 - OEIS

This site is supported by donations to The OEIS Foundation.

A105565

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

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; internal format)

	OFFSET	`1,1`
	COMMENTS	`The sequence is almost periodic, see also A105566;` `a(n) = 1 - A105563(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.` `Sequence in context: A155897 A144610 A181632 * A068717 A049240 A138712` `Adjacent sequences: A105562 A105563 A105564 * A105566 A105567 A105568`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 14 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.