Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019482
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019482 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(4,28) (agrees with A019481 for n <= 19 only). +0
1
4, 28, 197, 1387, 9766, 68764, 484179, 3409187, 24004668, 169020968, 1190105509, 8379736191, 59003154006, 415451286688, 2925263479867, 20597279875727, 145028966176516, 1021173725712004, 7190258646781909 (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;.

FORMULA

Appears to satisfy a(n) = 7*a(n-1) + a(n-2) - 5*a(n-3).

CROSSREFS

Sequence in context: A001396 A155611 A002903 this_sequence A090965 A106258 A085363

Adjacent sequences: A019479 A019480 A019481 this_sequence A019483 A019484 A019485

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research