id:A018903 - OEIS Search Results

Search: id:A018903

Displaying 1-1 of 1 results found.

page 1

Define the sequence S(a_0,a_1) by a_{n+2} is the least integer such that a_{n+2}/a_{n+1}>a_{n+1}/a_n for n >= 0 . This is S(1,5).

+0
1

1, 5, 26, 136, 712, 3728, 19520, 102208, 535168, 2802176, 14672384, 76825600, 402264064, 2106281984, 11028635648, 57746685952, 302365573120, 1583206694912, 8289777876992, 43405840482304, 227275931385856 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`D. W. Boyd, Linear recurrence relations for some generalized Pisot sequences, Advances in Number Theory ( Kingston ON, 1991) 333-340, Oxford Sci. Publ., Oxford Univ. Press, New York, 1993;.`
	LINKS	`INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 879`
	FORMULA	`a(n) = (a_1+1)a(n-1) - (a_1-1)a(n-2).`
	CROSSREFS	`Sequence in context: A047768 A022032 A052918 this_sequence A083331 A076025 A161731` `Adjacent sequences: A018900 A018901 A018902 this_sequence A018904 A018905 A018906`
	KEYWORD	`nonn`
	AUTHOR	`R. K. Guy (rkg(AT)cpsc.ucalgary.ca)`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research