A338285 - OEIS

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

A338285

a(n) = Sum_{k = n+1-A338283(n)..n} A338283(n).

1, 3, 4, 7, 5, 8, 12, 6, 9, 13, 10, 14, 15, 11, 19, 16, 21, 18, 17, 22, 23, 29, 20, 25, 31, 26, 32, 27, 33, 34, 28, 40, 35, 36, 43, 37, 30, 44, 52, 24, 51, 38, 39, 46, 54, 41, 48, 47, 55, 42, 49, 57, 50, 58, 59, 60, 45, 67, 53, 61, 62, 71, 63, 56, 64, 73, 65

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Will every integer, except 2, appear in this sequence?

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, Colored scatterplot of the first 10000 terms (where the color is function of A338283(n))

Rémy Sigrist, PARI program for A338285

EXAMPLE

A338283(4) = 3, so a(4) = A338283(2) + A338283(3) + A338283(4) = 2 + 2 + 3 = 7.

PROG