id:A125058 - OEIS Search Results

Search: id:A125058

Displaying 1-1 of 1 results found.

page 1

A sequence of words over an alphabet of two letters: a(0) = 1, a(1) = 2; a(n+2) = a(n+1)a(n)a(n+1).

+0
2

1, 2, 212, 2122212, 21222122122122212, 21222122122122212212221221222122122122212, 21222122122122212212221221222122122122212212221221221222122122212212212221221222\ 1221222122122122212 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`A055642(a(n)) = A001333(n). - Reinhard Zumkeller, Feb 02 2007`
	REFERENCES	`Suggested by a posting by Igor G. Korepanov to "Jim's Forum", Jan 10 2007.`
	FORMULA	`a(n)=(a(n-1)A011557(A001333(n-2))+a(n-2))A011557(A001333(n-2))+a(n-1). - Reinhard Zumkeller, Feb 02 2007`
	CROSSREFS	`Sequence in context: A107612 A090560 A078280 this_sequence A101393 A124188 A078276` `Adjacent sequences: A125055 A125056 A125057 this_sequence A125059 A125060 A125061`
	KEYWORD	`nonn,base`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jan 10 2007`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research