Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147568 a(n)=2A000695(n)+3 +0
3
3, 5, 11, 13, 35, 37, 43, 45, 131, 133, 139, 141, 163, 165, 171, 173, 515, 517, 523, 525, 547, 549, 555, 557, 643, 645, 651, 653, 675, 677 (list; graph; listen)
OFFSET

0,1

COMMENT

Every odd number m>=9 is a unique sum of the form a(k)+2a(l); moreover this sequence is the unique one with such property. In connection with A103151, note that there is no subsequence T of primes such that every odd number m>=9 is expressible as a unique sum of the form m=p+2q, where p and q are in T. One can prove that if one replaces 9 by any integer x_o>9, the statement remains true (see the preprint arxiv.org/abs/0811.0290).

CROSSREFS

Cf. A000695 A062880 A103151

Sequence in context: A095082 A105071 A089251 this_sequence A006794 A032457 A122564

Adjacent sequences: A147565 A147566 A147567 this_sequence A147569 A147570 A147571

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Nov 07 2008

EXTENSIONS

Instead of "we conjecture" I wrote "one can prove". - Vladimir Shevelev (shevelev(AT)bgu.ac.il), Nov 10 2008

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 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research