id:A116918 - OEIS Search Results

Search: id:A116918

Displaying 1-1 of 1 results found.

page 1

a(1)=a(2)=1. a(n) = A020639(a(n-1)) + A006530(a(n-2)).

+0
1

1, 1, 2, 3, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`For n >= 0, a(11n+5) = 5, a(11n+6) = 8, a(11n+7) = 7, a(11n+8) = 9, a(11n+9) = 10, a(11n+10) = 5, a(11n+11) = 10, a(11n+12) = 7, a(11n+13) = 12, a(11n+14) = 9, a(11n+15) = 6.`
	CROSSREFS	`Cf. A006530, A020639.` `Adjacent sequences: A116915 A116916 A116917 this_sequence A116919 A116920 A116921` `Sequence in context: A065115 A010075 A010074 this_sequence A116917 A121369 A125727`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Feb 26 2006`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research