A007952 -id:A007952 - cp's OEIS frontend

A002491 Smallest number of stones in Tchoukaillon (or Mancala, or Kalahari) solitaire that make use of n-th hole.

1, 2, 4, 6, 10, 12, 18, 22, 30, 34, 42, 48, 58, 60, 78, 82, 102, 108, 118, 132, 150, 154, 174, 192, 210, 214, 240, 258, 274, 282, 322, 330, 360, 372, 402, 418, 442, 454, 498, 510, 540, 570, 612, 622, 648, 672, 718, 732, 780, 802, 840, 870, 918

Offset: 1

N. J. A. Sloane

To get n-th term, start with n and successively round up to next multiple of n-1, n-2, ..., 1.
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.
Comment from Don Knuth, Jun 08 2021, added by N. J. A. Sloane, Jun 09 2021: (Start)
I have put together a preliminary exposition of the results of Broline and Loeb (1995), in what's currently called Exercise 11 (on page 7) and its answer (on pages 9 and 10) of the Bipartite Matching document.
Unfortunately, I believe this paper erred when it claimed to have proved the conjecture of Erdős and Jabotinsky about the sharpness of approximation to n^2/pi. When they computed the sum of I_M in the proof of Theorem 9, they expressed it as f(M-1)^2/4M + O(f(M-1)). That's correct; but the error gets quite large, and when summed gives O(n^(3/2)), not O(n).
By summing over only part of the range, and using another estimate in the rest, I believe one can get an overall error bound O(n^(4/3)), thus matching the result of Erdős and Jabotinsky but not improving on it. (End)

			To get 10th term: 10->18->24->28->30->30->32->33->34->34.

Y. David, On a sequence generated by a sieving process, Riveon Lematematika, 11 (1957), 26-31.
S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.4.7.
V. Gautheron, Chapter 3.II.5: La Tchouka, in Wari et Solo: le Jeu de calculs africain (Les Distracts), Edited by A. Deledicq and A. Popova, CEDIC, Paris, 1977, 180-187.
D. E. Knuth, Bipartite Matching, The Art of Computer Programming, Vol. 4, Pre-fascicle 14A, June 8, 2021, http://cs.stanford.edu/~knuth/fasc14a.ps.gz. See Sect. 7.5.1, Exercise 11.
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).

Kerry Mitchell, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
D. Betten, Kalahari and the Sequence "Sloane No. 377", Annals Discrete Math., 37, 51-58, 1988.
D. M. Broline and Daniel E. Loeb, The combinatorics of Mancala-Type games: Ayo, Tchoukaillon and 1/Pi, J. Undergrad. Math. Applic., vol. 16 (1995), pp. 21-36; arXiv:math/9502225 [math.CO], 1995.
K. S. Brown, Rounding Up To PI
Y. David, On a sequence generated by a sieving process, Riveon Lematematika, 11 (1957), 26-31. [Annotated scan of pages 31 and 27 only]
Mark Dukes, Sequences of integer pairs related to the game of Tchoukaillon solitaire, University College Dublin (Ireland, 2020).
Mark Dukes, Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire, Journal of Integer Sequences, Vol. 24 (2021), Article 21.7.1.
Mark Dukes, Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire, arXiv:2202.02381 [math.NT], 2022.
P. Erdős and E. Jabotinsky, On a sequence of integers generated by a sieving process (Part I), Indagationes Math., 20, 115-128, 1958.
P. Erdős and E. Jabotinsky, On a sequence of integers generated by a sieving process (Part II), Indagationes Math., 20, 115-128, 1958.
B. Gourevitch, The World of Pi
Nick Hobson, Python program for this sequence
Brant Jones, Laura Taalman and Anthony Tongen, Solitaire Mancala Games and the Chinese Remainder Theorem, Amer. Math. Mnthly, 120 (2013), 706-724.
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
Eric Weisstein's World of Mathematics, Pi.
Eric Weisstein's World of Mathematics, Pi Formulas.
Index entries for sequences generated by sieves

Cf. A000012, A000960, A028920, A028931, A028932, A028933, A112557, A112558, A113742, A113743, A113744, A113745, A113746, A113747, A113748, A113749.
Cf. also A104738.
A row of the array in A344009.

a002491 n = a002491_list !! (n-1)
a002491_list = sieve 1 [1..] where
   sieve k (x:xs) = x : sieve (k+1) (mancala xs) where
      mancala xs = us ++ mancala vs where (us,v:vs) = splitAt k xs
-- Reinhard Zumkeller, Oct 31 2012

# A002491
# program due to B. Gourevitch
a := proc(n)
local x,f,i,y;
  x := n; f := n;
  for i from x by -1 to 2 do
     y := i-1;
     while y < f do
       y := y+i-1
     od;
  f := y
  od
end:
seq(a(n), n = 2 .. 53);

f[n_] := Fold[ #2*Ceiling[ #1/#2 + 0] &, n, Reverse@Range[n - 1]]; Array[f, 56] (* Robert G. Wilson v, Nov 05 2005 *)
del[list_, k_] := Delete[list, Table[{i}, {i, k, Length[list], k}]]; a[n_] := Last@NestWhile[{#[[1]] + 1, del[Rest@#[[2]], #[[1]] + 1], Append[#[[3]], First@#[[2]]]} &, {1,Range[n], {}}, #[[2]] =!= {} &]; a[1000] (* Birkas Gyorgy, Feb 26 2011 *)
Table[1 + First@FixedPoint[{Floor[#[[1]]*(#[[2]] + 1/2)/#[[2]]], #[[2]] + 1} &, {n, 1}, SameTest -> (#1[[1]] == #2[[1]] &)], {n, 0, 30}] (* Birkas Gyorgy, Mar 07 2011 *)
f[n_]:=Block[{x,p},For[x=p=1, p<=n, p++, x=Ceiling[(n+2-p)x/(n+1-p)]];x] (* Don Knuth, May 27 2021 *)

a(n)=forstep(k=n-1,2,-1, n=((n-1)\k+1)*k); n \\ Charles R Greathouse IV, Mar 29 2016

Equals A007952(n) + 1 or equally A108696(n) - 1.
A130747(a(n)) = 1. - Reinhard Zumkeller, Jun 23 2009
a(n+1) = 1 + [..[[[[n*3/2]5/4]7/6]9/8]...(2k+1)/2k]...]. - Birkas Gyorgy, Mar 07 2011
Limit_{n -> oo} n^2/a(n) = Pi (see Brown). - Peter Bala, Mar 12 2014
It appears that a(n)/2 = A104738(n-1). - Don Knuth, May 27 2021

A007606 Take 1, skip 2, take 3, etc.

Original entry on oeis.org

1, 4, 5, 6, 11, 12, 13, 14, 15, 22, 23, 24, 25, 26, 27, 28, 37, 38, 39, 40, 41, 42, 43, 44, 45, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 137, 138

Offset: 1

N. J. A. Sloane, Robert G. Wilson v, Mira Bernstein

List the natural numbers: 1, 2, 3, 4, 5, 6, 7, ... . Keep the first number (1), delete the next two numbers (2, 3), keep the next three numbers (4, 5, 6), delete the next four numbers (7, 8, 9, 10) and so on.
a(A000290(n)) = A000384(n). - Reinhard Zumkeller, Feb 12 2011
A057211(a(n)) = 1. - Reinhard Zumkeller, Dec 30 2011
Numbers k with the property that the smallest Dyck path of the symmetric representation of sigma(k) has a central valley. (Cf. A237593.) - Omar E. Pol, Aug 28 2018
Union of nonzero terms of A000384 and A317304. - Omar E. Pol, Aug 29 2018
The values of k such that, in a listing of all congruence classes of positive integers, the k-th congruence class contains k. Here the class r mod m (with r in {1,...,m}) precedes the class r' mod m' (with r' in {1,...,m'}) iff mA360418. - James Propp, Feb 10 2023

			From _Omar E. Pol_, Aug 29 2018: (Start)
Written as an irregular triangle in which the row lengths are the odd numbers the sequence begins:
    1;
    4,   5,   6;
   11,  12,  13,  14,  15;
   22,  23,  24,  25,  26,  27,  28;
   37,  38,  39,  40,  41,  42,  43,  44,  45;
   56,  57,  58,  59,  60,  61,  62 , 63,  64,  65,  66;
   79,  80,  81,  82 , 83,  84,  85,  86,  87,  88,  89,  90,  91;
  106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120;
...
Row sums give A005917.
Column 1 gives A084849.
Column 2 gives A096376, n >= 1.
Right border gives A000384, n >= 1.
(End)

C. Dumitrescu & V. Seleacu, editors, Some Notions and Questions in Number Theory, Vol. I, Erhus Publ., Glendale, 1994.
R. Honsberger, Mathematical Gems III, M.A.A., 1985, p. 177.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
F. Smarandache, Properties of Numbers, 1972.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
C. Dumitrescu & V. Seleacu, editors, Some Notions and Questions in Number Theory, Vol. I.
Index entries for sequences generated by sieves

Complement of A007607.
Cf. A007950, A007951, A007952, A048859, A004201.
Cf. A000384, A005917, A084849, A096376.

a007606 n = a007606_list !! (n-1)
a007606_list = takeSkip 1 [1..] where
   takeSkip k xs = take k xs ++ takeSkip (k + 2) (drop (2*k + 1) xs)
-- Reinhard Zumkeller, Feb 12 2011

Flatten[ Table[i, {j, 1, 17, 2}, {i, j(j - 1)/2 + 1, j(j + 1)/2}]] (* Robert G. Wilson v, Mar 11 2004 *)
Join[{1},Flatten[With[{nn=20},Range[#[[1]],Total[#]]&/@Take[Thread[ {Accumulate[ Range[nn]]+1,Range[nn]}],{2,-1,2}]]]] (* Harvey P. Dale, Jun 23 2013 *)
With[{nn=20},Take[TakeList[Range[(nn(nn+1))/2],Range[nn]],{1,nn,2}]]//Flatten (* Harvey P. Dale, Feb 10 2023 *)

for(n=1,66,m=sqrtint(n-1);print1(n+m*(m+1),","))

a(n) = n + m*(m+1) where m = floor(sqrt(n-1)). - Klaus Brockhaus, Mar 26 2004

a(n+1) = a(n) + if n=k^2 then 2*k+1 else 1; a(1) = 1. - Reinhard Zumkeller, May 13 2009

A028920 Pit harvesting sequence for winning solitaire Tchoukaillon (or Mancala).

Original entry on oeis.org

1, 2, 1, 3, 1, 4, 1, 2, 1, 5, 1, 6, 1, 2, 1, 3, 1, 7, 1, 2, 1, 8, 1, 4, 1, 2, 1, 3, 1, 9, 1, 2, 1, 10, 1, 5, 1, 2, 1, 3, 1, 11, 1, 2, 1, 4, 1, 12, 1, 2, 1, 3, 1, 6, 1, 2, 1, 13, 1, 14, 1, 2, 1, 3, 1, 4, 1, 2, 1, 5, 1, 7, 1, 2, 1, 3, 1, 15, 1, 2, 1, 16, 1, 4, 1, 2, 1, 3, 1, 8, 1, 2, 1, 6, 1, 5, 1, 2, 1, 3, 1, 17, 1

Offset: 0

David W. Wilson

nonn

From Benoit Cloitre, Mar 09 2007: (Start)
The sequence can be constructed as follows using parentheses (NP means "term not in parentheses"):
Start from the positive integers:
1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,...
Step 1: put the least NP "1" in parentheses and every 2 terms giving:
(1),2,(3),4,(5),6,(7),8,(9),10,(11),12,(13),14,(15),16,(17),18,(19),...
Step 2: put the least NP "2" in 2 parentheses and every 3 NP giving:
(1),((2)),(3),4,(5),6,(7),((8)),(9),10,(11),12,(13),((14)),(15),16,(17),...
so that between 2 consecutives ((x)) there are 2 NP.
Step 3: put the least NP "4" in 3 parentheses and every 4 NP giving:
(1),((2)),(3),(((4))),(5),6,(7),((8)),(9),10,(11),12,(13),((14)),(15),(((16))),...
so that between 2 consecutives (((x))) there are 3 NP.
Step 4: put the least NP "6" in 4 parentheses and every 5 NP giving:
(1),((2)),(3),(((4))),(5),((((6)))),(7),((8)),(9),10,(11),12,(13),((14)),(15),(((16))),...
so that between 2 consecutives ((((x)))) there are 4 NP.
Iterating the process indefinitely yields:
(1),((2)),(3),(((4))),(5),((((6)))),(7),((8)),(9),(((((10))))),(11),...
Count the parentheses:
1,2,1,3,1,4,1,2,1,5,1,... - this is the sequence.
(End)
From Benoit Cloitre, Jul 26 2007: (Start)
A simpler way to construct the sequence: start from
1,,1,,1,,1,,1,,1,,1,_,1,... where 1's are spaced by one hole;
fill first hole with 2 and leave 2 holes between two 2's giving
1,2,1,,1,,1,2,1,,1,,1,2,1,...;
fill new first hole with 3 and leave 3 holes between two 3's giving
1,2,1,3,1,,1,2,1,,1,_,1,2,1,3...;
iterating the process indefinitely yields the sequence.
(End)
Ordinal transform of A130747. - Benoit Cloitre, Aug 03 2007
Although this sequence and A130747 are not fractal sequences (according to Kimberling's definition), we say they are "mutual fractal sequences" since the ordinal transform of one gives the other. - Benoit Cloitre, Aug 03 2007
The smallest n with a(n) = k is circa k^2/Pi.
The element n >= 0 occurs in this sequence with limiting density 1/(n*(n+1)).

L. K. Mitchell, Table of n, a(n) for n=0..3280
Franklin T. Adams-Watters, Doubly Fractal Sequences and ordinal transform
D. M. Broline and Daniel E. Loeb, The combinatorics of Mancala-Type games: Ayo, Tchoukaillon and 1/Pi, arXiv:math/9502225 [math.CO], 1995; J. Undergrad. Math. Applic., vol. 16 (1995), pp. 21-36.
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
Index entries for sequences generated by sieves

Cf. A002491, A007952, A028931, A028932, A028933, A130747.

n = 15; Fold[If[Length@Position[#1, 0] > 0, ReplacePart[#1,First /@ Partition[Position[#1, 0], #2 + 1, #2 + 1, {1, 1}] -> #2], #1] &,  Flatten@Array[{1, 0} &, n], Range[2, 2 n]] (* Birkas Gyorgy, Feb 26 2011 *)

a(n) = {ok = 0; m = 1; while (!ok, if ((n%(m+1) == 0), ok = 1, n = n*m\(m+1); m++);); m;} \\ Michel Marcus, Dec 06 2015

a(2n+1) = 1 + A104706(n+1), a(2n) = 1. - Benoit Cloitre, Mar 09 2007

The sieve of A007952 processes n in the a(n)-th pass. a(A007952(n)) = n+1.

Additional comments from David W. Wilson, Feb 25 2010

A028933 Table of winning positions in Tchoukaillon (or Mancala) solitaire.

Original entry on oeis.org

0, 1, 0, 2, 1, 2, 0, 1, 3, 1, 1, 3, 0, 0, 2, 4, 1, 0, 2, 4, 0, 2, 2, 4, 1, 2, 2, 4, 0, 1, 1, 3, 5, 1, 1, 1, 3, 5, 0, 0, 0, 2, 4, 6, 1, 0, 0, 2, 4, 6, 0, 2, 0, 2, 4, 6, 1, 2, 0, 2, 4, 6, 0, 1, 3, 2, 4, 6, 1, 1, 3, 2, 4, 6, 0, 0, 2, 1, 3, 5, 7, 1, 0, 2, 1, 3, 5, 7

Offset: 0

N. J. A. Sloane

Table read by rows where b(n,i) = the number of counters in the i-th position from the store of the unique winning Tchoukaillon board having n total counters.

			   The rows of b(n,i) begin
   n\i 1 2 3 4 5 6
   1   1
   2   0 2
   3   1 2
   4   0 1 3
   5   1 1 3
   6   0 0 2 4
   7   1 0 2 4
   8   0 2 2 4
   9   1 2 2 4
   10  0 1 1 3 5
   11  1 1 1 3 5
   12  0 0 0 2 4 6
   13  1 0 0 2 4 6
   14  0 2 0 2 4 6
   15  1 2 0 2 4 6
   16  0 1 3 2 4 6
   17  1 1 3 2 4 6

D. Betten, Kalahari and the Sequence "Sloane No. 377", Annals Discrete Math., 37, 51-58, 1988.
D. M. Broline and _Daniel E. Loeb_, The combinatorics of Mancala-Type games: Ayo, Tchoukaillon and 1/Pi, J. Undergrad. Math. Applic., vol. 16 (1995), pp. 21-36.
Brant Jones, Laura Taalman and Anthony Tongen, Solitaire Mancala Games and the Chinese Remainder Theorem, Amer. Math. Monthly, 120 (2013), 706-724.

Cf. A002491, A028920, A007952, A028931, A028932, A028933.

s[list_] := Module[{x = Append[list, 0], i = 1}, While[x[[i]] =!= 0, x[[i]] = x[[i]] - 1; i = i + 1]; x[[i]] = i; If[Last@x == 0, Most[x], x]]; Prepend[Flatten@NestList[s, {}, 20],0] (* Birkas Gyorgy, Feb 26 2011 *)

Let p(n) be the minimum j such that b(n,j) = 0.  (This is A028920.)
Directly from the rules of Tchoukaillon, we find b(n+1,i) = (b(n,i) - 1 for 1 <= i < p(n), i for i = p(n), and b(n,i) for i > p(n)).
Also, b(n,i) = (n - Sum_{j=1..(i-1)} b(n,j)) mod (i+1).

Formulas added by Brant Jones, Oct 14 2013

A082447 a(n) = the number k such that s(k)=0 where s(0)=n and s(i)=s(i-1)-(s(i-1) modulo (i+1)).

Original entry on oeis.org

1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15

Offset: 1

Benoit Cloitre, Apr 25 2003

nonn

a(n+1) = number of Mancala numbers <= n, see A007952; n occurs A028913(n-1) times consecutively. - Reinhard Zumkeller, Jun 21 2008

a(n) = number of ones <= n in A130747; see also A002491. - Reinhard Zumkeller, Jul 01 2009

			For n=4, s(0)=4, 4 ->4-4 mod 1=4 ->4-4 mod 2=4 ->4-4 mod 3=3 ->3-3 mod 4=0, hence s(4)=0 and a(4)=4.
For n=6, s(0)=6, s(1)=6-6 mod 2=6, s(2)=6-6 mod 3=6, s(3)=6-6 mod 4=6-2=4, s(4)=4-4 mod 5=0, hence a(6)=4.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A073047, A140060, A140061.

Flatten@Table[First@Position[Rest@FoldList[#1-Mod[#1,#2]&,i,Range[2,i+1]],0], {i,30}] (* Birkas Gyorgy, Feb 26 2011 *)

a(n)=if(n<1, 0, s=n; c=1; while(s-s%c>0, s=s-s%c; c++); c--) \\ corrected by Dan Dima, Jan 18 2025

Conjecture: a(n) = sqrt(Pi*n) + O(1)

a(n) = A073047(n) - 1.

Name corrected by Dan Dima, Jan 18 2025

A028931 Strings giving winning positions in Tchoukaillon (or Mancala) solitaire.

Original entry on oeis.org

0, 1, 20, 21, 310, 311, 4200, 4201, 4220, 4221, 53110, 53111, 642000, 642001, 642020, 642021, 642310, 642311, 7531200, 7531201, 7531220, 7531221, 86420110, 86420111, 86424000, 86424001, 86424020, 86424021, 86424310, 86424311

Offset: 0

N. J. A. Sloane

a(n) gives string listing winning position for n stones.
Sum of numbers in a(n) is equal to n.
Using the chromatic (tet-12) scale, (if C=0, 12, 24...) all integers correspond to pitches C, C#, G#, A, Bb, B, a recursive pattern that evenly bisects the octave and avoids the tritone (IC6). - Nik Bizzell-Browning, Apr 27 2019

			For example, a(10) = 53111; rightmost 0 is in position 6, so get 653111 -> a(11) = 642000.

Nik Bizzell-Browning, Tchoukaillon solitaire sequence, Chromatic pitch table and example.
Nicholas John Bizzell-Browning, LIE scales: Composing with scales of linear intervallic expansion, Ph. D. Thesis, Brunel Univ. (UK, 2024). See p. 142.
D. M. Broline and _Daniel E. Loeb_, The combinatorics of Mancala-Type games: Ayo, Tchoukaillon and 1/Pi, J. Undergrad. Math. Applic., vol. 16 (1995), pp. 21-36.

Cf. A002491, A007952, A028920, A028932, A028933.

a[1] = {0};a[n_]:=a[n]=Module[{gs=a[n-1],len=Length[a[n-1]],pos},If[FreeQ[gs,0],Prepend[gs-1,1+len],pos=FirstPosition[Reverse[gs],0][[1]];(gs[[;;len-pos]])~Join~{pos}~Join~If[pos==1,{},(gs[[len-pos+2;;]]-1)]]];StringJoin/@Map[ToString, Array[a, 30], {2}] (* Shenghui Yang, Jun 06 2025 *)

To get the next term, if rightmost 0 is in position i, replace it by i and subtract 1 from all earlier entries.

More terms from Erich Friedman

A028932 Triangular array of winning positions in Tchoukaillon (or Mancala) solitaire.

Original entry on oeis.org

0, 1, 2, 0, 2, 1, 3, 1, 0, 3, 1, 1, 4, 2, 0, 0, 4, 2, 0, 1, 4, 2, 2, 0, 4, 2, 2, 1, 5, 3, 1, 1, 0, 5, 3, 1, 1, 1, 6, 4, 2, 0, 0, 0, 6, 4, 2, 0, 0, 1, 6, 4, 2, 0, 2, 0, 6, 4, 2, 0, 2, 1, 6, 4, 2, 3, 1, 0, 6, 4, 2, 3, 1, 1, 7, 5, 3, 1, 2, 0, 0, 7, 5, 3, 1, 2, 0, 1

Offset: 0

N. J. A. Sloane

The 300 names of Mancala: Abalala'e, Abanga, Abangah, Abouga, Achara, Adi, Adita ta, Adito, Adji, Adjiboto, Adjika, Adji pre, Adjito, Aghi, Agi, Aji, Ajwa, Ale, Andot, Annana, Anywoli, Awale, Awale, Aware, Awari, Awele, Awele Ayo, Ayo Ayo, Azigo,
Ba-Awa, Banga, Bao, Bao kiswahili, Bao solo, Bare, Baruma, Bau, Bawo, Bechi, Boke, Bosh, Bouberoukou, Bouri, Chanka, Chisolo, Chongkak, Choro, Chouba, Chuba, Chunca, Cisolo, Congkak, Coo, Coro, Coro bawo,
Dabuda, dakon, Dakoun, Dara, Darra, Deka, Djonghok, Djonglak, Dwong, erherhe, Endodoi, Enkeshui, Eson xorgol, Esson, eu leu, Fangaya, Fuva, Gabata, Gabatta, Galatjang, Gamacha, Gbegele, Gebta, Gelo, Gepeta, Gesuwa, Gilberta, Giuthi,
Halusa, Hus, Igisoro, Ikiokoto, Imbelece, Imbwe, Impere, Isafu, Ise onzin egbe, Isofu, Isolo, J'erin, jodu, J'odu, Jukuru, Kachig, Ka ia, Kalah, Kalaha, Kalak, Kale, Kalimanta, Kasonko, Katra, Kboo, Kenji guki, Kiarabu, Kisolo, Kiswahilibao, Kiuthi, Kpo, !Krour, Kubuguza,
La'b hakim, La'b madjunni, La'b roseya, Lahemay walida, Lami, Lamlameta, Lamosh, Lam waladach, Langa holo, Layo, leka, Lela, Leyla gobale, Lien, Lizolo, L'ob akila, Lonbeu a cha, Lontu Holo, Luzolo,
Mancala, Mandiare, Manga, Mangala, Mangola, Mankala, Manqala, Manquala, Marabout, Marany, Maruba, Mazageb, Mbangi, Mbau, Mbelete, Mbere, Mbo, Mbothe, Mefuhva, Meusueb, Mewelad, Mofuba, Moro gbegele, Motiq, Msuwa, Mulabalaba, Mungala, Mutiteba, Mwambalula, Mweiso, Mweso,
Nakabile, Nambayi, Naranj, Ncholokoto, Nchomvwa, Nchuba, Nchuwa, Ndoto, Ngar, Njombwa, Nocholokoto, Nsolo, Nsumbi, Ntchuwa, Nummun,
Oko, Olinda, Okwe, Omweeso, Omweso, Otep, Otjitoko, Ot jun, Otra, Ot tjin, Otu, Oure, Ouri, Ourin, Ourre, Ourri, Oware, Owela, Palankuli, Pallamkurie, Pallam kuzhi, Pallanguli, Pallankuli, Pandi, Papadakon, Papandata, Pensur, Pereauni, Peresouni, Poo, Qaluta, Qasuta, Qelat, Ryakati,
Saddeka, Sadeka, Sadiqa, Schach, Serata, Sig, Solo, Sombi, Songo, Soro, Spreta, Sulus ni!shtaw, Sunca, Sungka, Tagega, Tamtam apachi, Tap, Tapata, Tchanka, Tchokajon, Tchonkkak, Tchoukaitlon, Tchukaruma, Tegre, Tjonglak, Toguz xorgol, Toi, Tonka, Topuz xorgol, Tchuba, Tchela, Tshuba, Tshi solo, Tsoro,
Ubao, Ugwasi, Um el bagara, Um el banat, Um el tuweisat, Urdy, Ure, Vai lung thlan, Wale, Walle, Walu, Walya, Ware, Wari, Warri, Wawee, Wawi, Weg, Woaley, Wori, Woribo, Woro, Wouri, Wuli, Wuri, Xorgol, Yada, Yit nuri, Yovodji.

			Triangle begins:
0,
1,
2, 0,
2, 1,
3, 1, 0,
3, 1, 1,
4, 2, 0, 0,
4, 2, 0, 1,
4, 2, 2, 0,
4, 2, 2, 1,
5, 3, 1, 1, 0,
5, 3, 1, 1, 1,
6, 4, 2, 0, 0, 0,
6, 4, 2, 0, 0, 1,
6, 4, 2, 0, 2, 0,
6, 4, 2, 0, 2, 1,
6, 4, 2, 3, 1, 0,
6, 4, 2, 3, 1, 1,
7, 5, 3, 1, 2, 0, 0,
7, 5, 3, 1, 2, 0, 1
...

Y. David, On a sequence generated by a sieving process, Riveon Lematematika, 11 (1957), 26-31.
C. Zaslavsky, Africa Counts: Number and Pattern in Traditional African Culture, Boston: Prindle, Weber and Schmidt, 1973.

D. Betten, Kalahari and the Sequence "Sloane No. 377", Annals Discrete Math., 37, 51-58, 1988.
E. Brisse, African Games Information and Links
D. M. Broline and _Daniel E. Loeb_, The combinatorics of Mancala-Type games: Ayo, Tchoukaillon and 1/Pi, J. Undergrad. Math. Applic., vol. 16 (1995), pp. 21-36.
D. Eppstein, Combinatorial Game Theory
P. Erdős and E. Jabotinsky, On a sequence of integers generated by a sieving process (Part I), Indagationes Math., 20, 115-123, 1958.
P. Erdős and E. Jabotinsky, On a sequence of integers generated by a sieving process (Part II), Indagationes Math., 20, 124-128, 1958.
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
R. W. Wilder, Review of "Africa Counts: Number and Pattern in Traditional African Culture", Historia Mathematica, Vol. 2 (1975), pp. 207-210.
C. Zaslavsky, African and Multicultural Mathematics
Index entries for sequences generated by sieves

Cf. A002491, A007952, A028920, A028931, A028933.

s[list_] := Module[{x = Append[list, 0], i = 1}, While[x[[i]] =!= 0, x[[i]] = x[[i]] - 1; i = i + 1]; x[[i]] = i;If[Last@x == 0, Most[x], x]]; Flatten[Reverse /@ NestList[s, {}, 20]] (* Birkas Gyorgy, Feb 26 2011 *)

To get the next row in the triangle, find the rightmost zero entry in the current row (which may be to the left of the existing entries). In this zero is in position k (counting from the right), change it from 0 to k and subtract 1 from all the entries to its right.

Additional references from Labos Elemer, Nov 07 2000

Revised by N. J. A. Sloane, Jul 16 2012

cp's OEIS Frontend

A028913 First differences of A007952.

Views

Author

Keywords

Links

Crossrefs

Extensions

A141271 Number of partitions of n into nonzero Mancala numbers (A007952).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A141272 Number of partitions of n into distinct nonzero Mancala numbers (A007952).

Views

Author

Keywords

Examples

Crossrefs

A002491 Smallest number of stones in Tchoukaillon (or Mancala, or Kalahari) solitaire that make use of n-th hole.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

A007606 Take 1, skip 2, take 3, etc.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

A028920 Pit harvesting sequence for winning solitaire Tchoukaillon (or Mancala).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A028933 Table of winning positions in Tchoukaillon (or Mancala) solitaire.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A082447 a(n) = the number k such that s(k)=0 where s(0)=n and s(i)=s(i-1)-(s(i-1) modulo (i+1)).

Views

Author

Keywords

Comments