Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019475
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019475 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(2,10). +0
1
2, 10, 51, 261, 1336, 6839, 35009, 179212, 917391, 4696149, 24039712, 123059927, 629947050, 3224715759, 16507406022, 84501851928, 432567234958, 2214323218841, 11335179646638, 58025087091309 (list; graph; listen)
OFFSET

0,1

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;.

CROSSREFS

Sequence in context: A037514 A037717 A019476 this_sequence A020042 A075436 A074612

Adjacent sequences: A019472 A019473 A019474 this_sequence A019476 A019477 A019478

KEYWORD

nonn

AUTHOR

R. K. Guy (rkg(AT)cpsc.ucalgary.ca)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research