login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 4
1, 2, 4, 8, 13, 21, 31, 45, 60, 76, 97, 119, 144, 170, 198, 231, 265, 300, 336, 374, 414, 456, 502, 550, 599, 649, 702, 759, 819, 881, 945, 1010, 1080, 1157, 1237, 1318, 1401, 1486, 1572, 1662, 1753, 1845, 1945, 2049, 2156, 2264 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 1..1999

PROG

(MATLAB) s=1:2000^2; d(1)=1; A004978(1)=1; A004978(2)=2;

for n=3:2000

  A004978(n)=A004978(n-1)+find([d, 0]~=s(1:max(size(d))+1), 1);

  d(end+1:end+n-1)=A004978(n)-A004978(1:n-1);

  d=sort(unique(d));

end - Nathaniel Johnston (nathaniel(AT)nathanieljohnston.com), Feb 9 2011

CROSSREFS

Differences give A002048, see also A048201.

For n>2, a(n) equals A002049(n-1)+1 and A048204(n-2)+2.

Sequence in context: A130840 A115266 A026039 * A005282 A046185 A073336

Adjacent sequences:  A004975 A004976 A004977 * A004979 A004980 A004981

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Definition corrected by Bryan S. Robinson, Mar 16 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 08:12 EST 2012. Contains 205451 sequences.