Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019477
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019477 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(3,15) (agrees with A019478 only for n <= 23). +0
2
3, 15, 76, 386, 1961, 9963, 50618, 257170, 1306579, 6638211, 33726124, 171349094, 870556961, 4422955527, 22471287314, 114167721214, 580041026803, 2946958993287, 14972332829596, 76068500060858 (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: A047015 A037759 A037647 this_sequence A019478 A151327 A125700

Adjacent sequences: A019474 A019475 A019476 this_sequence A019478 A019479 A019480

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research