id:A049341 - OEIS Search Results

Search: id:A049341

Displaying 1-1 of 1 results found.

page 1

a(n+1) = iterated sum of digits of a(n) + a(n-1).

+0
3

3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Terms of the simple continued fraction of 21447/[sqrt(1347705679)-29932]. [From Paolo P. Lava (ppl(AT)spl.at), Aug 06 2009]`
	LINKS	`Michael Gilleland, Some Self-Similar Integer Sequences`
	FORMULA	`Period 8.` `a(n)=1/224{45(n mod 8)+213[(n+1) mod 8]-123[(n+2) mod 8]+129[(n+3) mod 8]+45[(n+4) mod 8]+129[(n+5) mod 8]-39[(n+6) mod 8]-39*[(n+7) mod 8]} with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Nov 27 2006`
	EXAMPLE	`After 6,9 we get 6+9 = 15 -> 1+5 = 6.`
	CROSSREFS	`Cf. A030132, A049342.` `Sequence in context: A019700 A151862 A067722 this_sequence A137991 A021077 A114041` `Adjacent sequences: A049338 A049339 A049340 this_sequence A049342 A049343 A049344`
	KEYWORD	`base,nonn`
	AUTHOR	`Damir Olejar (damir666(AT)hotmail.com)`

page 1

Search completed in 0.002 seconds

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.

AT&T Labs Research