cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A003045 M0491 #24 Oct 22 2023 00:19:56
%S A003045 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 A003045 77,84,86,91,95,97,114,122,123,126,133,142,144,148,162,171,173,175,
%U A003045 190,197,205,208,216,227,232,243,244,258,265,272,278,280,291,298,309,314,326
%N 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.
%D A003045 R. K. Guy, Unsolved Problems in Number Theory, Section C4.
%D A003045 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A003045 Seiichi Manyama, <a href="/A003045/b003045.txt">Table of n, a(n) for n = 1..10000</a>
%H A003045 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 A003045 Cf. A003044.
%K A003045 nonn
%O A003045 1,2
%A A003045 _N. J. A. Sloane_
%E A003045 Definition revised by Duncan Moore (duncan.moore(AT)gmx.com), Feb 20 2010
%E A003045 More terms from _Jon E. Schoenfield_, Mar 26 2010