id:A105565 - OEIS Search Results

Search: id:A105565

Displaying 1-1 of 1 results found.

page 1

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

+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; listen)

	OFFSET	`1,1`
	COMMENT	`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: A030190 A123506 A051105 this_sequence A068717 A049240 A138712` `Adjacent sequences: A105562 A105563 A105564 this_sequence A105566 A105567 A105568`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Apr 14 2005`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research