login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A145819
Union of A145812 and A145818 with double repetition of 1, so that a(1)=1, a(2)=1
4
1, 1, 3, 5, 9, 11, 17, 21, 33, 35, 41, 43, 65, 69, 81, 85, 129, 131, 137, 139, 161, 163, 169, 171, 257, 261, 273, 277, 321, 325, 337, 341
OFFSET
1,3
COMMENTS
Theorem. For every even integer m there exists a representation of the form m=a(r)+a(s). If A(x) is the counting function of a(n)<=x, then A(x)=O(sqrt(x))and Omega(sqrt(x)). Conjecture. The sequence is minimal in the following sense: if any sequence has the counting function B(x)<=A(x) for all x>=1 and B(x) < A(x) for x>=x_0, then there exists an even integer N which is not expressible as a sum of two terms of such sequence.
CROSSREFS
Sequence in context: A138203 A225523 A007952 * A317827 A296768 A302596
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Oct 20 2008
STATUS
approved