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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062292 A B_2 sequence: a(n) is the smallest cube such that the pairwise sums of {a(1)...a(n)} are all distinct. 2

%I

%S 1,8,27,64,125,216,343,512,729,1000,1331,2197,2744,3375,4913,5832,

%T 6859,8000,9261,10648,12167,15625,17576,19683,21952,24389,27000,29791,

%U 35937,42875,50653,54872,59319,64000,68921,74088,79507,85184,91125,97336

%N A B_2 sequence: a(n) is the smallest cube such that the pairwise sums of {a(1)...a(n)} are all distinct.

%C A Mian-Chowla sequence consisting only of cubes.

%e During recursive construction of this set, for n=1-50, the cubes of 12,18,24,32,34,36,48 are left out to keep all sums of distinct cubes distinct from each other.

%Y Cf. A011185, A010672, A025582, A005282, A062294.

%K nonn

%O 1,2

%A _Labos Elemer_, Jul 02 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 22:00 EDT 2019. Contains 327283 sequences. (Running on oeis4.)