Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048224
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048224 a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=4. +0
2
1, 4, 5, 7, 12, 21, 31, 43, 56, 71, 89, 110, 133, 162, 194, 228, 265, 306, 349, 394, 441, 489, 542, 598, 655, 715, 778, 843, 912, 984, 1058, 1133, 1209, 1289, 1370, 1453, 1539, 1626, 1719, 1813, 1909, 2006, 2105, 2205, 2309, 2416 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A032390 A112918 A138920 this_sequence A064237 A139373 A069575

Adjacent sequences: A048221 A048222 A048223 this_sequence A048225 A048226 A048227

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research