id:A116917 - OEIS Search Results

Search: id:A116917

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`1,3`
	FORMULA	`For n >= 1, a(4n+2) = 8, a(4n+3) = 7, a(4n+4) = 9, a(4n+5) = 10.`
	CROSSREFS	`Cf. A006530.` `Adjacent sequences: A116914 A116915 A116916 this_sequence A116918 A116919 A116920` `Sequence in context: A010075 A010074 A116918 this_sequence A121369 A125727 A112337`
	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