id:A078412 - OEIS Search Results

Search: id:A078412

Displaying 1-1 of 1 results found.

page 1

a(0) = 5, a(1) = 8; for n >1, a(n)=(a(n-1)+a(n-2))/3^n, where 3^n is the highest power of 3 dividing a(n-1)+a(n-2).

+0
2

5, 8, 13, 7, 20, 1, 7, 8, 5, 13, 2, 5, 7, 4, 11, 5, 16, 7, 23, 10, 11, 7, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2 (list; graph; listen)

	OFFSET	`0,1`
	FORMULA	`a(3n-1)=2, a(3n)=1, a(3n+1)=1 for n>=8. - Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 04 2003`
	CROSSREFS	`Cf. A000045, A078414.` `Sequence in context: A138051 A026279 A124434 this_sequence A046038 A070127 A070128` `Adjacent sequences: A078409 A078410 A078411 this_sequence A078413 A078414 A078415`
	KEYWORD	`nonn,easy`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Dec 28, 2002`
	EXTENSIONS	`More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 04 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research