This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A002466 A jumping problem. (Formerly M1066 N0402) 0
 1, 1, 2, 4, 7, 13, 17, 30, 60, 107, 197, 257, 454, 908, 1619, 2981, 3889, 6870, 13740, 24499, 45109, 58849, 103958, 207916, 370723, 682597, 890513, 1573110, 3146220, 5609843, 10329173, 13475393, 23804566, 47609132, 84889091, 156302789 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 REFERENCES A. P. Domoryad, Mathematical Games and Pastimes. Macmillan, NY, 1964, p. 259. N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS FORMULA a(1) = a(2) = 1, a(3) = 2, a(5*k+2) = a(5*k+1) + a(5*k-1), a(5*k+3) = a(5*k+2) + a(5*k+1), a(5*k+b) = a(5*k+b-1) + a(5*k+b-2) + a(5*k+b-3) for b=-1,0,1 [From Domoryad]. - Sean A. Irvine, Apr 21 2016 CROSSREFS Sequence in context: A002152 A163522 A255173 * A162842 A164901 A109853 Adjacent sequences:  A002463 A002464 A002465 * A002467 A002468 A002469 KEYWORD nonn AUTHOR EXTENSIONS More terms from Sean A. Irvine, Apr 21 2016 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.

Last modified December 15 20:49 EST 2018. Contains 318154 sequences. (Running on oeis4.)