Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004979
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004979 a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=a, a(2)=3. +0
2
1, 3, 4, 8, 14, 22, 31, 43, 58, 74, 94, 116, 140, 165, 191, 223, 256, 290, 327, 365, 406, 451, 498, 546, 599, 655, 714, 775, 837, 901, 969, 1038, 1112, 1188, 1265, 1343, 1424, 1508, 1595, 1683, 1772, 1868, 1966, 2066, 2169, 2274 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A048212, A048216, A048217.

Sequence in context: A091231 A049893 A103002 this_sequence A051788 A023623 A023558

Adjacent sequences: A004976 A004977 A004978 this_sequence A004980 A004981 A004982

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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research