A003045 a(n) (n>6) is least integer > a(n-1) with precisely three representations a(n) = a(i) + a(j), 1 <= i < j < n, a(n) = n for n=1..6.

1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 19, 21, 23, 25, 30, 44, 46, 48, 50, 55, 65, 73, 74, 77, 84, 86, 91, 95, 97, 114, 122, 123, 126, 133, 142, 144, 148, 162, 171, 173, 175, 190, 197, 205, 208, 216, 227, 232, 243, 244, 258, 265, 272, 278, 280, 291, 298, 309, 314, 326

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn

References

• R. K. Guy, Unsolved Problems in Number Theory, Section C4.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• Seiichi Manyama, Table of n, a(n) for n = 1..10000
• R. Queneau, Sur les suites s-additives, J. Combin. Theory, A12 (1972), 31-71.

Crossrefs

Cf. A003044.

Extensions

Definition revised by Duncan Moore (duncan.moore(AT)gmx.com), Feb 20 2010

More terms from Jon E. Schoenfield, Mar 26 2010