id:A007395 - OEIS Search Results

Search: id:A007395

Displaying 1-1 of 1 results found.

page 1

The all 2's sequence.
(Formerly M0208)

+0
30

2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Also the iterated factorials of the number 2: 2!, (2!)!, ((2!)!)! - Peter C. Heinig (algorithms(AT)gmx.de), Apr 16 2006` `Continued fraction for 1+sqrt(2) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 14 2006`
	LINKS	`Tanya Khovanova, Recursive Sequences` `Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)` `Daniele A. Gewurz and Francesca Merola, Sequences realized as Parker vectors ..., J. Integer Seqs., Vol. 6, 2003.` `Eric Weisstein's World of Mathematics, Hamiltonian Cycle`
	MATHEMATICA	`Table[2, {105}]`
	CROSSREFS	`Cf. A000004, A000012, A010701.` `Adjacent sequences: A007392 A007393 A007394 this_sequence A007396 A007397 A007398` `Sequence in context: A046698 A036453 A040000 this_sequence A055642 A036452 A102572`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 15 13:16 EDT 2008. Contains 139641 sequences.

AT&T Labs Research