|
Search: id:A072424
|
|
|
| A072424 |
|
The five's sequence merely counts the letters in the words of the generating sentence. |
|
+0
1
|
|
| 5, 3, 6, 2, 3, 7, 2, 3, 5, 4, 2, 4, 8, 3, 2, 3, 6, 3, 2, 3, 5, 3, 2, 3, 6, 5, 2, 3, 5, 5, 2, 3, 5, 3, 2, 3, 7, 5, 2, 3, 6, 4, 2, 3, 5, 4, 2, 3, 5, 2, 2, 3, 8, 4, 23, 7, 5, 2, 3, 10, 5, 2, 3, 10, 2, 3, 9, 5, 2, 3, 9, 3, 2, 3, 11, 3, 2, 3, 10, 3, 2, 3, 10
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
M. J. Halm, Newies, Mpossibilities 64, p. 2 (Mar. 1997)
|
|
LINKS
|
M. J. Halm, neologisms
|
|
FORMULA
|
From the generating sentence: "Five's the number of letters in the first word of this sentence, three in the second, six in the third, two in the fourth, three in the fifth ..."
|
|
EXAMPLE
|
a(1) = 5 because the first word, five's, is five letters.
|
|
CROSSREFS
|
Sequence in context: A073685 A019212 A021655 this_sequence A089250 A075264 A011504
Adjacent sequences: A072421 A072422 A072423 this_sequence A072425 A072426 A072427
|
|
KEYWORD
|
easy,nonn,word
|
|
AUTHOR
|
Michael Joseph Halm (hierogamous(AT)lycos.com), Jul 31 2002
|
|
|
Search completed in 0.002 seconds
|
