Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060470
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060470 Smallest positive a(n) such that number of solutions to a(n)=a(j)+a(k) j<k<n is two or less. +0
5
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 17, 19, 24, 26, 28, 33, 35, 37, 42, 44, 46, 51, 53, 55, 60, 62, 64, 69, 71, 73, 78, 80, 82, 87, 89, 91, 96, 98, 100, 105, 107, 109, 114, 116, 118, 123, 125, 127, 132, 134, 136, 141, 143, 145, 150, 152, 154, 159, 161, 163, 168, 170 (list; graph; listen)
OFFSET

1,2

COMMENT

Numbers {1,6,8} mod 9 plus {2,3,4,5,12}.

EXAMPLE

12 is in the sequence since it is 4+8 and 2+10 but no other sum of two distinct terms.

CROSSREFS

Cf. A003044, A033627, A060469, A060470, A060471, A060472. Virtually identical to A003663.

Sequence in context: A018478 A018350 A033058 this_sequence A003044 A018541 A018293

Adjacent sequences: A060467 A060468 A060469 this_sequence A060471 A060472 A060473

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Mar 15 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research