login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072424 The five's sequence merely counts the letters in the words of the generating sentence. 0
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; 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..83.

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: A019212 A201928 A021655 * A089250 A155681 A075264

Adjacent sequences:  A072421 A072422 A072423 * A072425 A072426 A072427

KEYWORD

easy,nonn,word

AUTHOR

Michael Joseph Halm, Jul 31 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 00:10 EDT 2019. Contains 327990 sequences. (Running on oeis4.)