

A072425


The fouris sequence merely counts the letters in the words of the generating sentence.


0



4, 2, 3, 6, 2, 3, 7, 2, 3, 5, 4, 24, 8, 3, 2, 3, 6, 5, 2, 3, 5, 3, 2, 3, 6, 3, 2, 3, 5, 5, 2, 3, 5, 5, 2, 3, 7, 3, 2, 3, 6, 5, 2, 3, 5, 4, 2, 3, 5, 4, 2, 3, 8, 3, 2, 3, 7, 5, 2, 3, 10, 5, 2, 3, 10, 2, 3, 9, 5, 2, 3, 9, 3, 2, 3, 11, 4, 2, 3, 10, 3, 2, 3, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


REFERENCES

M. J. Halm, Newies, Mpossibilities 64, p. 2 (Mar. 1997)


LINKS

Table of n, a(n) for n=1..84.
M. J. Halm, neologisms


FORMULA

From the generating sentence: "Four is the number of letters in the first word of this sentence, two in the second, three in the third, six in the fourth, two in the fifth ..."


EXAMPLE

a(2) = 2 because the second word, 'is', has two letters.


CROSSREFS

Sequence in context: A098317 A095185 A128009 * A282865 A241051 A275590
Adjacent sequences: A072422 A072423 A072424 * A072426 A072427 A072428


KEYWORD

easy,nonn,word


AUTHOR

Michael Joseph Halm, Jul 31 2002


STATUS

approved



