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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006020 Suspense numbers for Tribulations.
(Formerly M2237)
0
3, 2, 1, 4, 3, 1, 3, 3, 2, 5, 4, 5, 2, 5, 1, 3, 3, 2, 5, 4, 3, 4, 5, 2, 5, 4, 3, 5, 4, 3, 2, 5, 3, 5, 5, 3, 4, 5, 2, 5, 4, 2, 5, 4, 7, 2, 5, 2, 5, 4, 2, 4, 5, 3, 5, 4, 5, 2, 5, 4, 2, 4, 4, 7, 2, 1, 4, 3, 3, 5, 5, 2, 3, 4, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 502.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

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

CROSSREFS

Sequence in context: A097294 A060848 A265271 * A224381 A190704 A190698

Adjacent sequences:  A006017 A006018 A006019 * A006021 A006022 A006023

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 13:27 EST 2016. Contains 278750 sequences.