login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002466 A jumping problem.
(Formerly M1066 N0402)
1

%I M1066 N0402 #28 Oct 16 2023 23:27:28

%S 1,1,2,4,7,13,17,30,60,107,197,257,454,908,1619,2981,3889,6870,13740,

%T 24499,45109,58849,103958,207916,370723,682597,890513,1573110,3146220,

%U 5609843,10329173,13475393,23804566,47609132,84889091,156302789

%N A jumping problem.

%D A. P. Domoryad, Mathematical Games and Pastimes. Macmillan, NY, 1964, p. 259.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

%H Paolo Xausa, <a href="/A002466/b002466.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,15,0,0,0,0,2).

%F 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

%F From _Chai Wah Wu_, Dec 20 2019: (Start)

%F a(n) = 15*a(n-5) + 2*a(n-10) for n > 10.

%F G.f.: x*(-2*x^9 - 2*x^6 + 2*x^5 - 7*x^4 - 4*x^3 - 2*x^2 - x - 1)/(2*x^10 + 15*x^5 - 1). (End)

%t A002466list[nmax_]:=LinearRecurrence[{0,0,0,0,15,0,0,0,0,2},{1,1,2,4,7,13,17,30,60,107},nmax];A002466list[50] (* _Paolo Xausa_, Jun 26 2023 *)

%K nonn,easy

%O 1,3

%A _N. J. A. Sloane_

%E More terms from _Sean A. Irvine_, Apr 21 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)