Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004978
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A004978
%S A004978 1,2,4,8,13,21,31,45,60,76,97,119,144,170,198,231,265,300,336,374,414,
%T A004978 456,502,550,599,649,702,759,819,881,945,1010,1080,1157,1237,1318,1401,
%U A004978 1486,1572,1662,1753,1845,1945,2049,2156,2264
%N A004978 a(n)=least number m such that m-a(n-1) != a(j)-a(k) for all j,k less 
               than n; a(1)=1, a(2)=2.
%Y A004978 Differences give A002048, see also A048201.
%Y A004978 For n>2, a(n) equals A002049(n-1)+1 and A048204(n-2)+2.
%Y A004978 Sequence in context: A130840 A115266 A026039 this_sequence A005282 A046185 
               A073336
%Y A004978 Adjacent sequences: A004975 A004976 A004977 this_sequence A004979 A004980 
               A004981
%K A004978 nonn
%O A004978 1,2
%A A004978 Clark Kimberling (ck6(AT)evansville.edu)
%E A004978 Definition corrected by Bryan S. Robinson, Mar 16 2006

    
page 1

Search completed in 0.001 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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research