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!)
A003412 From a nim-like game.
(Formerly M0559)
1

%I M0559 #26 Jun 22 2017 07:00:58

%S 1,2,3,4,6,8,11,14,18,24,32,43,54,68,86,110,142,185,239,307,393,503,

%T 645,830,1069,1376,1769,2272,2917,3747,4816,6192,7961,10233,13150,

%U 16897,21713,27905,35866,46099,59249,76146,97859,125764,161630,207729,266978

%N From a nim-like game.

%D R. K. Guy, personal communication.

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

%H Vincenzo Librandi, <a href="/A003412/b003412.txt">Table of n, a(n) for n = 0..1000</a>

%H R. K. Guy, <a href="/A003410/a003410.pdf">Letter to N. J. A. Sloane, Apr 1975</a>

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

%F Recurrence: a(n) = a(n-1) + a(n-6) for n >= 12.

%F O.g.f.: -(1+x+x^2+x^3+2*x^4+2*x^5+2*x^6+x^7+x^8+2*x^9+2*x^10+3*x^11) / (-1+x+x^6). - _R. J. Mathar_, Dec 05 2007

%t Join[{1, 2, 3, 4, 6, 8}, LinearRecurrence[{1, 0, 0, 0, 0, 1}, {11, 14, 18, 24, 32, 43}, 80]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 11 2012 *)

%Y Cf. A005708.

%K nonn

%O 0,2

%A _N. J. A. Sloane_

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 April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)