Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062292
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A062292
%S A062292 1,8,27,64,125,216,343,512,729,1000,1331,2197,2744,3375,4913,5832,6859,
%T A062292 8000,9261,10648,12167,15625,17576,19683,21952,24389,27000,29791,35937,
%U A062292 42875,50653,54872,59319,64000,68921,74088,79507,85184,91125,97336
%N A062292 A B_2 sequence: a(n) is the smallest cube such that the pairwise sums 
               of {a(1)...a(n)} are all distinct.
%C A062292 A Mian-Chowla sequence consisting only of cubes.
%e A062292 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 A062292 Cf. A011185, A010672, A025582, A005282, A062294.
%Y A062292 Sequence in context: A118880 A048390 A000578 this_sequence A030295 A052045 
               A014187
%Y A062292 Adjacent sequences: A062289 A062290 A062291 this_sequence A062293 A062294 
               A062295
%K A062292 nonn
%O A062292 1,2
%A A062292 Labos E. (labos(AT)ana.sote.hu), Jul 02 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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research