|
|
A026471
|
|
a(n) = least positive integer > a(n-1) and not of the form a(i) + a(j) + a(k) for 1 <= i < j < k <= n.
|
|
8
|
|
|
1, 2, 3, 4, 5, 13, 14, 15, 25, 26, 27, 37, 38, 48, 49, 50, 60, 61, 71, 72, 73, 83, 84, 94, 95, 96, 106, 107, 117, 118, 119, 129, 130, 140, 141, 142, 152, 153, 163, 164, 165, 175, 176, 186, 187, 188, 198, 199, 209, 210, 211, 221, 222, 232, 233, 234, 244, 245, 255
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
{1, 5, 13} union {n congruent 2, 3, 4, 14, 15 mod 23}, proved by Matthew Akeran. - Ralf Stephan, Nov 15 2004
G.f.: (9*x^11-7*x^10+9*x^8+7*x^5+x^4+x^3+x^2+x+1)*x/(x^6-x^5-x+1). - Alois P. Heinz, Aug 06 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|