Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051912
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051912 a[n] = smallest integer such that the sum of any three ordered terms a[k; k<n ] is unique. +0
7
0, 1, 4, 13, 32, 71, 124, 218, 375, 572, 744, 1208, 1556, 2441, 3097, 4047, 5297, 6703, 7838, 10986, 12331, 15464, 19143, 24545, 28973, 34405, 37768, 45863, 50876, 61371, 68302, 77917, 88544, 101916, 122031, 131624, 148574, 171236, 197814 (list; graph; listen)
OFFSET

0,3

EXAMPLE

Three terms chosen from {0,1,4} can be 0+0+0; 0+0+1; 0+1+1; 1+1+1; 0+0+4; 0+1+4; 1+1+4; 0+4+4; 1+4+4; 4+4+4 are all distinct (3*4*5/6 =10 terms), so a[3]= 4 is the next integer of the sequence.

CROSSREFS

Cf. A025582, A036241, A062065.

Sequence in context: A036487 A011936 A037235 this_sequence A060099 A036420 A054039

Adjacent sequences: A051909 A051910 A051911 this_sequence A051913 A051914 A051915

KEYWORD

nonn,easy,nice

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be), Dec 17 1999

EXTENSIONS

More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jul 22 2001

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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research