|
|
A072425
|
|
The four-is sequence merely counts the letters in the words of the generating sentence.
|
|
0
|
|
|
4, 2, 3, 6, 2, 7, 2, 3, 5, 4, 2, 4, 8, 3, 2, 3, 6, 5, 2, 3, 5, 3, 2, 3, 6, 3, 2, 3, 5, 5, 2, 3, 5, 3, 2, 3, 7, 5, 2, 3, 6, 4, 2, 3, 5, 4, 2, 3, 5, 3, 2, 3, 8, 4, 2, 3, 7, 5, 2, 3, 10, 5, 2, 3, 10, 3, 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
|
|
|
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
|
|
|
KEYWORD
|
easy,nonn,word
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|