A334631 - OEIS

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

A334631

a(n) = number of letters in the sum of all previous terms, with a(1) = 1 (in US English, excluding spaces and hyphens).

1, 3, 4, 5, 8, 9, 6, 9, 9, 9, 10, 12, 10, 10, 14, 18, 21, 20, 22, 10, 13, 21, 19, 20, 21, 16, 18, 23, 20, 21, 14, 18, 21, 20, 22, 22, 19, 22, 16, 21, 22, 18, 21, 20, 22, 12, 18, 18, 22, 19, 22, 18, 22, 20, 22, 23, 18, 21, 20, 22, 22

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

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..61.

EXAMPLE

a(4) = 5, as a(1) + a(2) + a(3) = 8 and 8 has 5 letters in English.

CROSSREFS

Cf. A000655, A005589.

Sequence in context: A215497 A092997 A021747 * A105020 A286053 A112594

Adjacent sequences: A334628 A334629 A334630 * A334632 A334633 A334634

KEYWORD

nonn,word,easy,less

AUTHOR

Robert Bilinski, Sep 14 2020

STATUS

approved