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!)
A019995 From George Gilbert's marks problem: jumping 6 marks at a time (initial positions). 1
1, 2, 5, 8, 10, 27, 31, 37, 38, 102, 110, 126, 219, 245, 309, 389, 474, 648, 653, 719, 979, 4642, 8745, 17984, 27374, 33806, 47578, 63375, 155060, 214982, 222936, 774303, 1212989, 1314605, 1914365, 2148329, 4213072, 7179881, 27679209 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

G. T. Gilbert, M. I. Krusemeyer and L. C Larson, The Wohascum Problem Book, Math. Assoc of America, 1993, Problem 103, p. 25; Solution, pp. 163-164.

LINKS

Table of n, a(n) for n=0..38.

CROSSREFS

Cf. A019996.

Sequence in context: A157481 A100809 A056734 * A188802 A031141 A143263

Adjacent sequences:  A019992 A019993 A019994 * A019996 A019997 A019998

KEYWORD

nonn

AUTHOR

R. K. Guy (computed by Marc Paulhus).

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 2 19:13 EST 2016. Contains 278683 sequences.