Search: id:A002491
Results 1-1 of 1 results found.

%I A002491 M1009 N0377
%S A002491 1,2,4,6,10,12,18,22,30,34,42,48,58,60,78,82,102,108,118,132,150,
%T A002491 154,174,192,210,214,240,258,274,282,322,330,360,372,402,418,442,
%U A002491 454,498,510,540,570,612,622,648,672,718,732,780,802,840,870,918
%N A002491 Smallest number of stones in Tchoukaillon (or Mancala, or Kalahari) solitaire 
               which make use of n-th hole.
%C A002491 A130747(a(n)) = 1. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Jun 23 2009]
%D A002491 D. Betten, Kalahari and the Sequence "Sloane No. 377", Annals Discrete 
               Math., 37, 51-58, 1988.
%D A002491 Y. David, On a sequence generated by a sieving process, Riveon Lematematika, 
               11 (1957), 26-31.
%D A002491 P. Erdos and E. Jabotinsky, On a sequence of integers ..., Indagationes 
               Math., 20, 115-128, 1958.
%D A002491 S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.4.7.
%D A002491 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002491 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A002491 T. D. Noe, <a href="b002491.txt">Table of n, a(n) for n=1..1000</a>
%H A002491 K. S. Brown, <a href="http://www.mathpages.com/home/kmath001.htm">Rounding 
               Up To PI</a>
%H A002491 D. M. Broline and D. E. Loeb (daniel.loeb(AT)verizon.net), <a href="http:/
               /arXiv.org/abs/math.CO/9502225">The combinatorics of Mancala-Type 
               games: Ayo, Tchoukaillon and 1/Pi</a>, J. Undergrad. Math. Applic., 
               vol. 16 (1995), pp. 21-36.
%H A002491 Nick Hobson, <a href="a002491.py.txt">Python program for this sequence</
               a>
%H A002491 N. J. A. Sloane, <a href="http://www.research.att.com/~njas/doc/sg.txt">
               My favorite integer sequences</a>, in Sequences and their Applications 
               (Proceedings of SETA '98).
%H A002491 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Pi.html">Link to a section of The World of Mathematics (1).</a>
%H A002491 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PiFormulas.html">Link to a section of The World of Mathematics (2).</
               a>
%H A002491 <a href="Sindx_Si.html#sieve">Index entries for sequences generated by 
               sieves</a>
%F A002491 To get n-th term, start with n and successively round up to next multiple 
               of n-1, n-2, ..., 1.
%F A002491 Generated by a sieve: start with [ 1..n ]; keep first number, drop every 
               2nd, keep first, drop every 3rd, keep first, drop every 4th, etc.
%F A002491 Equals A007952(n)+1 or equally A108696(n)-1.
%e A002491 To get 10th term: 10->18->24->28->30->30->32->33->34->34.
%t A002491 f[n_] := Fold[ #2*Ceiling[ #1/#2 + 0] &, n, Reverse@Range[n - 1]]; Array[f, 
               56] (from Robert G. Wilson v (rgwv(at)rgwv.com), Nov 05 2005)
%Y A002491 Cf. A028920, A028931, A028932, A028933.
%Y A002491 Cf. A000012, A002491, A000960, A112557, A112558, A113742, A113743, A113744, 
               A113745, A113746, A113747, A113748; A113749.
%Y A002491 Sequence in context: A092249 A002088 A019332 this_sequence A045958 A076067 
               A065385
%Y A002491 Adjacent sequences: A002488 A002489 A002490 this_sequence A002492 A002493 
               A002494
%K A002491 nonn,easy,nice
%O A002491 1,2
%A A002491 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.002 seconds