login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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.
(Formerly M0491)
1

%I M0491 #24 Oct 22 2023 00:19:56

%S 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,

%T 77,84,86,91,95,97,114,122,123,126,133,142,144,148,162,171,173,175,

%U 190,197,205,208,216,227,232,243,244,258,265,272,278,280,291,298,309,314,326

%N 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.

%D R. K. Guy, Unsolved Problems in Number Theory, Section C4.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Seiichi Manyama, <a href="/A003045/b003045.txt">Table of n, a(n) for n = 1..10000</a>

%H R. Queneau, <a href="https://doi.org/10.1016/0097-3165(72)90083-0">Sur les suites s-additives</a>, J. Combin. Theory, A12 (1972), 31-71.

%Y Cf. A003044.

%K nonn

%O 1,2

%A _N. J. A. Sloane_

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

%E More terms from _Jon E. Schoenfield_, Mar 26 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 10:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)