Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060471
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060471 Smallest positive a(n) such that number of solutions to a(n)=a(j)+a(k) j<k<n is three or less. +0
4
1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 19, 21, 23, 25, 30, 32, 34, 36, 41, 43, 45, 47, 52, 54, 56, 58, 63, 65, 67, 69, 74, 76, 78, 80, 85, 87, 89, 91, 96, 98, 100, 102, 107, 109, 111, 113, 118, 120, 122, 124, 129, 131, 133, 135, 140, 142, 144, 146, 151, 153, 155, 157 (list; graph; listen)
OFFSET

1,2

COMMENT

Numbers {1,3,8,10} mod 11 plus {2,4,5,6,7,16}. Note that while the cases for "zero", "one", "two" and "four" essentially involve a third of the natural numbers, this case for "three" involves 4/11.

EXAMPLE

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

CROSSREFS

Cf. A033627, A060469, A060470, A060471, A060472.

Sequence in context: A022788 A141340 A033060 this_sequence A003045 A029750 A061920

Adjacent sequences: A060468 A060469 A060470 this_sequence A060472 A060473 A060474

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research