A006257 -id:A006257 - cp's OEIS frontend

A088333 A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer 3 places clockwise from i. Repeat, counting 3 places from the next undeleted integer, until only one integer remains.

1, 1, 2, 2, 1, 5, 2, 6, 1, 5, 9, 1, 5, 9, 13, 1, 5, 9, 13, 17, 21, 3, 7, 11, 15, 19, 23, 27, 2, 6, 10, 14, 18, 22, 26, 30, 34, 38, 3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 55, 59, 63, 67, 2, 6, 10, 14, 18, 22, 26, 30, 34, 38, 42

Offset: 1

N. J. A. Sloane, Nov 13 2003

If one counts only one place (resp. two places) at each stage to determine the element to be deleted, we get A006257 (resp. A054995).

See A054995 for references and links.

Index entries for sequences related to the Josephus Problem

Cf. A006257, A054995, A032434, A005427, A005428, A006257, A007495, A000960, A056530.

It is tempting (in view of A054995) to conjecture that a(1)=1 and, for n>1, a(n) = (a(n-1)+4) mod n. The conjecture is false; counterexample: a(21)=21; a(20)=17; (a(20)+4)mod 21=0; corrected formula: a(n)=(a(n-1)+3) mod n +1;
The conjecture is true. After removing the 4th number, we are reduced to the n-1 case, but starting with 5 instead of 1. - David Wasserman, Aug 08 2005
a(n) = A032434(n,4) if n>=4. - R. J. Mathar, May 04 2007

More terms from David Wasserman, Aug 08 2005

A088442 A linear version of the Josephus problem.

Original entry on oeis.org

1, 3, 1, 3, 9, 11, 9, 11, 1, 3, 1, 3, 9, 11, 9, 11, 33, 35, 33, 35, 41, 43, 41, 43, 33, 35, 33, 35, 41, 43, 41, 43, 1, 3, 1, 3, 9, 11, 9, 11, 1, 3, 1, 3, 9, 11, 9, 11, 33, 35, 33, 35, 41, 43, 41, 43, 33, 35, 33, 35, 41, 43, 41, 43, 129, 131, 129, 131, 137, 139, 137, 139, 129, 131

Offset: 0

N. J. A. Sloane, Nov 09 2003

Or a(n) is in A145812 such that (2*n + 3 - a(n))/2 is in A145812 as well. Note also that a(n) + 2*A090569(n+1) = 2*n + 3. - Vladimir Shevelev, Oct 20 2008

			If n=4, 2n+1 = 9 = 1 + 0*2 + 0*2^2 + 1*2^3, so a(4) = 1 + 0*2 + 1*2^3 = 9.

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
C. Groer, The Mathematics of Survival: From Antiquity to the Playground, Amer. Math. Monthly, 110 (No. 9, 2003), 812-825. (This is the sequence W(2n+1).)
Index entries for sequences related to the Josephus Problem

Cf. A006257, A063694, A088443, A088452, A090569, A145812.

a088442 = (+ 1) . a004514  -- Reinhard Zumkeller, Sep 26 2015

function A063694(n)
  if n le 1 then return n;
  else return 4*A063694(Floor(n/4)) + (n mod 2);
  end if; return A063694;
end function;
A088442:= func< n | 2*A063694(n) + 1 >;
[A088442(n): n in [0..100]]; // G. C. Greubel, Dec 05 2022

a:=proc(n) local b: b:=convert(2*n+1,base,2): 1+sum(b[2*j]*2^(2*j-1),j=1..nops(b)/2) end: seq(a(n),n=0..100);
with(Bits): seq(And(2*n+1, convert("aaaaaa", decimal, hex)) + 1, n=0..127); # Georg Fischer, Dec 03 2022

A004514[n_]:= A004514[n]= If[n==0, 0, 2*(n-A004514[Floor[n/2]])];
A088442[n_] := A004514[n] +1;
Table[A088442[n], {n,0,100}] (* G. C. Greubel, Dec 05 2022 *)

def A088442(n): return ((n&((1<<(m:=n.bit_length())+(m&1))-1)//3)<<1)+1 # Chai Wah Wu, Jan 30 2023

def A063694(n):
    if (n<2): return n
    else: return 4*A063694(floor(n/4)) + (n%2)
def A088442(n): return 2*A063694(n) + 1
[A088442(n) for n in range(101)] # G. C. Greubel, Dec 05 2022

To get a(n), write 2n+1 as Sum b_j 2^j, then a(n) = 1 + Sum_{j odd} b_j 2^j.
Equals A004514(n) + 1. - Chris Groer (cgroer(AT)math.uga.edu), Nov 10 2003
a(n) = 2*A063694(n) + 1. - G. C. Greubel, Dec 05 2022

More terms from Emeric Deutsch, May 27 2004

A360099 To get A(n,k), replace 0's in the binary expansion of n with (-1) and interpret the result in base k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

0, 0, 1, 0, 1, -1, 0, 1, 0, 1, 0, 1, 1, 2, -1, 0, 1, 2, 3, -1, 1, 0, 1, 3, 4, 1, 1, -1, 0, 1, 4, 5, 5, 3, 1, 1, 0, 1, 5, 6, 11, 7, 5, 3, -1, 0, 1, 6, 7, 19, 13, 11, 7, -2, 1, 0, 1, 7, 8, 29, 21, 19, 13, 1, 0, -1, 0, 1, 8, 9, 41, 31, 29, 21, 14, 3, 0, 1, 0, 1, 9, 10, 55, 43, 41, 31, 43, 16, 5, 2, -1

Offset: 0

Alois P. Heinz, Jan 25 2023

The empty bit string is used as binary expansion of 0, so A(0,k) = 0.

			Square array A(n,k) begins:
   0,  0, 0,  0,  0,   0,   0,   0,   0,   0,   0, ...
   1,  1, 1,  1,  1,   1,   1,   1,   1,   1,   1, ...
  -1,  0, 1,  2,  3,   4,   5,   6,   7,   8,   9, ...
   1,  2, 3,  4,  5,   6,   7,   8,   9,  10,  11, ...
  -1, -1, 1,  5, 11,  19,  29,  41,  55,  71,  89, ...
   1,  1, 3,  7, 13,  21,  31,  43,  57,  73,  91, ...
  -1,  1, 5, 11, 19,  29,  41,  55,  71,  89, 109, ...
   1,  3, 7, 13, 21,  31,  43,  57,  73,  91, 111, ...
  -1, -2, 1, 14, 43,  94, 173, 286, 439, 638, 889, ...
   1,  0, 3, 16, 45,  96, 175, 288, 441, 640, 891, ...
  -1,  0, 5, 20, 51, 104, 185, 300, 455, 656, 909, ...

Alois P. Heinz, Antidiagonals n = 0..200, flattened

Columns k=0-6, 10 give: A062157, A145037, A006257, A147991, A147992, A153777, A147993, A359925.
Rows n=0-10 give: A000004, A000012, A023443, A000027(k+1), A165900, A002061, A165900(k+1), A002061(k+1), A083074, A152618, A062158.
Main diagonal gives A360096.
Cf. A030300, A057427.

A:= proc(n, k) option remember; local m;
     `if`(n=0, 0, k*A(iquo(n, 2, 'm'), k)+2*m-1)
    end:
seq(seq(A(n, d-n), n=0..d), d=0..12);
# second Maple program:
A:= (n, k)-> (l-> add((2*l[i]-1)*k^(i-1), i=1..nops(l)))(Bits[Split](n)):
seq(seq(A(n, d-n), n=0..d), d=0..12);

G.f. for column k satisfies g_k(x) = k*(x+1)*g_k(x^2) + x/(1+x).
A(n,k) = k*A(floor(n/2),k)+2*(n mod 2)-1 for n>0, A(0,k)=0.
A(n,k) mod 2 = A057427(n) if k is even.
A(n,k) mod 2 = A030300(n) if k is odd and n>=1.
A(2^(n+1),1) + n = 0.

A049937 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.

Original entry on oeis.org

1, 1, 2, 5, 10, 24, 45, 89, 178, 444, 844, 1667, 3320, 6635, 13267, 26533, 53066, 132664, 252062, 497492, 991669, 1981685, 3962547, 7924694, 15849122, 31698155, 63396266, 126792511, 253585008, 507170011, 1014340019, 2028680037, 4057360074, 10143400184, 19272460350, 38037750692

Offset: 1

Clark Kimberling

nonn

			From _Petros Hadjicostas_, Nov 06 2019: (Start)
a(4) = a(2^ceiling(log_2(4-1)) + 2 - 4) + a(1) + a(2) + a(3) = a(2) + a(1) + a(2) + a(3) = 5.
a(5) = a(2^ceiling(log_2(5-1)) + 2 - 5) + a(1) + a(2) + a(3) + a(4) = a(1) + a(1) + a(2) + a(3) + a(4) = 10.
a(6) = a(2^ceiling(log_2(6-1)) + 2 - 6) + a(1) + a(2) + a(3) + a(4) + a(5) = a(4) + a(1) + a(2) + a(3) + a(4) + a(5) = 24.
a(7) =  a(7 - 1 - A006257(7-2)) + Sum_{i = 1..6} a(i) = a(3) +  Sum_{i = 1..6} a(i) = 45.
a(8) =  a(8 - 1 - A006257(8-2)) + Sum_{i = 1..7} a(i) = a(2) +  Sum_{i = 1..7} a(i) = 89. (End)

Cf. A006257, A049933, A049945.

s := proc(n) option remember; `if`(n < 1, 0, a(n) + s(n - 1)); end proc;
a := proc(n) option remember;
   `if`(n < 3, 1, `if`(n < 4, 2, s(n - 1) + a(Bits:-Iff(n - 2, n - 2) + 3 - n)));
end proc;
seq(a(n), n = 1 .. 30); # Petros Hadjicostas, Nov 06 2019

From Petros Hadjicostas, Nov 06 2019: (Start)
a(n) = a(2^ceiling(log_2(n-1)) + 2 - n) + Sum_{i = 1..n-1} a(i) for n >= 4.
a(n) = a(n - 1 - A006257(n-2)) + Sum_{i = 1..n-1} a(i) for n >= 4. (End)

Name edited by and more terms from Petros Hadjicostas, Nov 06 2019

A049940 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1) with a(1) = a(2) = 1.

Original entry on oeis.org

1, 1, 3, 6, 14, 26, 54, 119, 278, 503, 1008, 2027, 4094, 8412, 17554, 38194, 89848, 162143, 324288, 648587, 1297214, 2594652, 5190034, 10383154, 20779768, 41631830, 83498100, 167969126, 339831072, 695251878, 1453222088, 3162777148, 7438945312, 13424668537, 26849337076, 53698674163

Offset: 1

Clark Kimberling

nonn

			From _Petros Hadjicostas_, Sep 24 2019: (Start)
a(3) = a(1) + a(2) + a(m=1) = 1 + 1 + 1 = 3 because m = A006257(3-2) = 2*3 - 3 - 2^ceiling(log[2](3-1)) = 1.
a(4) = a(1) + a(2) + a(3) + a(m=1) = 1 + 1 + 3 + 1 = 6 because m = A006257(4-2) = 2*4 - 3 - 2^ceiling(log[2](4-1)) = 1.
a(5) = a(1) + a(2) + a(3) + a(4) + a(m=3) = 1 + 1 + 3 + 6 + 3 = 14 because m = A006257(5-2) = 2*5 - 3 - 2^ceiling(log[2](5-1)) = 3.
a(6) = a(1) + a(2) + a(3) + a(4) + a(5) + a(m=1) = 1 + 1 + 3 + 6 + 14 + 1 = 26 because m = A006257(6-2) = 2*6 - 3 - 2^ceiling(log[2](6-1)) = 1.
(End)

Alois P. Heinz, Table of n, a(n) for n = 1..3320

Cf. A006257, A049939, A049960, A049964.

a := proc(n) local vv, i; option remember; if n = 1 then vv := 1; end if; if n = 2 then vv := 1; end if; if 3 <= n then vv := 0; for i to n - 1 do vv := vv + a(i); end do; vv := vv + a(2*n - 3 - 2^ceil(log[2](n - 1))); end if; vv; end proc; # Petros Hadjicostas, Sep 24 2019
# second Maple program:
s:= proc(n) option remember; `if`(n<1, 0, a(n)+s(n-1)) end:
a:= proc(n) option remember; `if`(n<3, 1,
      s(n-1)+a(2*(n-2^ilog2(n-2))-3))
    end:
seq(a(n), n=1..36);  # Alois P. Heinz, Sep 24 2019

s[n_] := s[n] = If[n < 1, 0, a[n] + s[n-1]];
a[n_] := a[n] = If[n < 3, 1, s[n-1] + a[2(n - 2^Floor@Log[2, n-2]) - 3]];
Array[a, 36] (* Jean-François Alcover, Apr 23 2020, after Alois P. Heinz *)

a(n) = a(2*n - 3 - 2^ceiling(log_2(n-1))) + Sum_{i = 1..n-1} a(i) = a(A006257(n-2)) + Sum_{i = 1..n-1} a(i) for n >= 3 with a(1) = a(2) = 1. - Petros Hadjicostas, Sep 24 2019

Name edited by and more terms from Petros Hadjicostas, Sep 24 2019

A049945 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.

Original entry on oeis.org

1, 1, 4, 7, 14, 34, 65, 127, 254, 634, 1206, 2381, 4742, 9477, 18951, 37899, 75798, 189494, 360040, 710606, 1416477, 2830593, 5660011, 11319450, 22638520, 45276913, 90553764, 181107497, 362214974, 724429941, 1448859879, 2897719755, 5795439510, 14488598774, 27528337672, 54332245406

Offset: 1

Clark Kimberling

nonn

			From _Petros Hadjicostas_, Nov 06 2019: (Start)
a(4) = a(2^ceiling(log_2(4-1)) + 2 - 4) + a(1) + a(2) + a(3) = a(2) + a(1) + a(2) + a(3) = 7.
a(5) = a(2^ceiling(log_2(5-1)) + 2 - 5) + a(1) + a(2) + a(3) + a(4) = a(1) + a(1) + a(2) + a(3) + a(4) = 14.
a(6) = a(2^ceiling(log_2(6-1)) + 2 - 6) + a(1) + a(2) + a(3) + a(4) + a(5) = a(4) + a(1) + a(2) + a(3) + a(4) + a(5) = 34.
a(7) =  a(7 - 1 - A006257(7-2)) + Sum_{i = 1..6} a(i) = a(3) +  Sum_{i = 1..6} a(i) = 65.
a(8) =  a(8 - 1 - A006257(8-2)) + Sum_{i = 1..7} a(i) = a(2) +  Sum_{i = 1..7} a(i) = 127. (End)

Cf. A006257, A049933, A049937.

s:= proc(n) option remember; `if`(n<1, 0, a(n)+s(n-1)) end:
a:= proc(n) option remember; `if`(n<4, [1, 1, 4][n],
      s(n-1)+a(Bits:-Iff(n-2$2)+3-n))
    end:
seq(a(n), n=1..36); # Petros Hadjicostas, Nov 06 2019

From Petros Hadjicostas, Nov 06 2019: (Start)
a(n) = a(2^ceiling(log_2(n-1)) + 2 - n) + Sum_{i = 1..n-1} a(i) for n >= 4.
a(n) = a(n - 1 - A006257(n-2)) + Sum_{i = 1..n-1} a(i) for n >= 4. (End)

Name edited by and more terms from Petros Hadjicostas, Nov 06 2019

A049960 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), with a(1) = 1 and a(2) = 2.

Original entry on oeis.org

1, 2, 4, 8, 19, 35, 73, 161, 376, 680, 1363, 2741, 5536, 11375, 23737, 51647, 121495, 219254, 438511, 877037, 1754128, 3508559, 7018105, 14040383, 28098967, 56295692, 112908400, 227132417, 459528811, 940138484, 1965086401, 4276793213, 10059144016, 18153201632, 36306403267

Offset: 1

Clark Kimberling

nonn

Cf. A006257, A049939, A049940, A049964.

a := proc(n) option remember; if n<3 then return [1,2][n] fi; add(a(i), i=1..n-1) + a(2*(n-2) - Bits:-Iff(n-2, n-2)) end: seq(a(n), n=1..37); # Petros Hadjicostas, Sep 24 2019 by modifying a program by Peter Luschny

a(n) = a(A006257(n-2)) + Sum_{i = 1..n-1} a(i) for n >= 3 with a(1) = 1 and a(2) = 2. - Petros Hadjicostas, Sep 24 2019

Name edited and more terms from Petros Hadjicostas, Sep 24 2019

A256263 Triangle read by rows: T(j,k) = 2*k-1 if k is a power of 2, otherwise, between positions that are powers of 2 we have the initial terms of A016969, with j>=0, 1<=k<=A011782(j) and T(0,1) = 0.

Original entry on oeis.org

0, 1, 1, 3, 1, 3, 5, 7, 1, 3, 5, 7, 5, 11, 17, 15, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 23, 29, 35, 41, 31, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 23, 29, 35, 41, 31, 5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 63, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 23, 29, 35, 41, 31, 5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89

Offset: 0

Omar E. Pol, Mar 30 2015

Partial sums give A256264.
First differs from A160552 at a(27).
Appears to be a canonical sequence partially related to the cellular automata of A139250, A147562, A162795, A169707, A255366, A256250. See also A256264 and A256260.

			Written as an irregular triangle in which the row lengths are the terms of A011782, the sequence begins:
0;
1;
1,3;
1,3,5,7;
1,3,5,7,5,11,17,15;
1,3,5,7,5,11,17,15,5,11,17,23,29,35,41,31;
1,3,5,7,5,11,17,15,5,11,17,23,29,35,41,31,5,11,17,23,29,35,41,47,53,59,65,71,77,83,89,63;
...
Right border gives A000225.
Apart from the initial 0 the row sums give A000302.
Rows converge to A256258.
.
Illustration of initial terms in the fourth quadrant of the square grid:
---------------------------------------------------------------------------
n   a(n)                 Compact diagram
---------------------------------------------------------------------------
0    0     _
1    1    |_|_ _
2    1      |_| |
3    3      |_ _|_ _ _ _
4    1          |_| | | |
5    3          |_ _| | |
6    5          |_ _ _| |
7    7          |_ _ _ _|_ _ _ _ _ _ _ _
8    1                  |_| | | |_ _  | |
9    3                  |_ _| | |_  | | |
10   5                  |_ _ _| | | | | |
11   7                  |_ _ _ _| | | | |
12   5                  | | |_ _ _| | | |
13  11                  | |_ _ _ _ _| | |
14  17                  |_ _ _ _ _ _ _| |
15  15                  |_ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
16   1                                  |_| | | |_ _  | |_ _ _ _ _ _  | |
17   3                                  |_ _| | |_  | | |_ _ _ _ _  | | |
18   5                                  |_ _ _| | | | | |_ _ _ _  | | | |
19   7                                  |_ _ _ _| | | | |_ _ _  | | | | |
20   5                                  | | |_ _ _| | | |_ _  | | | | | |
21  11                                  | |_ _ _ _ _| | |_  | | | | | | |
22  17                                  |_ _ _ _ _ _ _| | | | | | | | | |
23  15                                  |_ _ _ _ _ _ _ _| | | | | | | | |
24   5                                  | | | | | | |_ _ _| | | | | | | |
25  11                                  | | | | | |_ _ _ _ _| | | | | | |
26  17                                  | | | | |_ _ _ _ _ _ _| | | | | |
27  23                                  | | | |_ _ _ _ _ _ _ _ _| | | | |
28  29                                  | | |_ _ _ _ _ _ _ _ _ _ _| | | |
29  35                                  | |_ _ _ _ _ _ _ _ _ _ _ _ _| | |
30  41                                  |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _| |
31  31                                  |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
.
a(n) is also the number of cells in the n-th region of the diagram.
A256264(n) gives the total number of cells after n-th stage.

Ivan Neretin, Table of n, a(n) for n = 0..8191
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to cellular automata

Cf. A000225, A000302, A011782, A038573, A006257, A016969, A139251, A160552, A256250, A256258, A256260, A256261, A256264, A256265.

Flatten@Join[{0}, NestList[Join[#, Range[Length[#] - 1]*6 - 1, {2 #[[-1]] + 1}] &, {1}, 6]] (* Ivan Neretin, Feb 14 2017 *)

Terms a(95) to a(98) fixed by Ivan Neretin, Feb 14 2017

A088163 Numbers for which rotating one binary place to the right less rotating one binary place to the left is equal to zero.

Original entry on oeis.org

0, 1, 2, 3, 7, 10, 15, 31, 42, 63, 127, 170, 255, 511, 682, 1023, 2047, 2730, 4095, 8191, 10922, 16383, 32767, 43690, 65535, 131071, 174762, 262143, 524287, 699050, 1048575, 2097151, 2796202, 4194303, 8388607, 11184810, 16777215, 33554431, 44739242, 67108863

Offset: 0

Robert G. Wilson v, Sep 13 2003

n is a member iff n is of the form 2^n -1 (A000225) or A000975(2n).

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (0,0,5,0,0,-4).

Cf. A000225, A000975.

f[n_] := FromDigits[ RotateRight[ IntegerDigits[n, 2]], 2] - FromDigits[ RotateLeft[ IntegerDigits[n, 2]], 2]; Select[ Range[33560000], f[ # ] == 0 &]
(* Or *) Union[ Join[ Table[2^n - 1, {n, 0, 25}], Table[ Ceiling[2(2^n - 1)/3], {n, 2, 24, 2}]]]
LinearRecurrence[{0,0,5,0,0,-4},{0,1,2,3,7,10},40] (* Harvey P. Dale, Feb 20 2022 *)

concat(0, Vec(x*(1+x)*(1+x+2*x^2) / ((1-x)*(1+x+x^2)*(1-4*x^3)) + O(x^50))) \\ Colin Barker, May 14 2016

Numbers n such that A038572(n) - A006257(n) = A088161(n) = 0.
From Colin Barker, May 14 2016: (Start)
a(n) = 5*a(n-3)-4*a(n-6) for n>5.
G.f.: x*(1+x)*(1+x+2*x^2) / ((1-x)*(1+x+x^2)*(1-4*x^3)).
(End)

A256250 Total number of ON states after n generations of a cellular automaton on the square grid.

Original entry on oeis.org

1, 5, 9, 21, 25, 37, 57, 85, 89, 101, 121, 149, 185, 229, 281, 341, 345, 357, 377, 405, 441, 485, 537, 597, 665, 741, 825, 917, 1017, 1125, 1241, 1365, 1369, 1381, 1401, 1429, 1465, 1509, 1561, 1621, 1689, 1765, 1849, 1941, 2041, 2149, 2265, 2389, 2521, 2661, 2809, 2965, 3129, 3301, 3481, 3669, 3865, 4069, 4281, 4501, 4729, 4965, 5209, 5461

Offset: 1

Omar E. Pol, Mar 20 2015

A256251 gives the number of cells turned ON at n-th stage.
Note that the number of cells turned ON at n-th stage in each one of its four quadrants is also A006257 (Josephus problem). For more information see A256249.
It appears that this is also a bisection of A256249.
First differs from A169707 at a(13), but both sequences share infinitely many terms. This one is simpler. Compare A169707.

			Also, written as an irregular triangle T(n,k), k >= 1, in which the row lengths are the terms of A011782 the sequence begins:
1;
5;
9,   21;
25,  37, 57, 85;
89, 101,121,149,185,229,281,341;
345,357,377,405,441,485,537,597,665,741,825,917,1017,1125,1241,1365;
...
Right border gives the positive terms of A002450.
It appears that this triangle at least shares with the triangles from the following sequences; A147562, A162795, A169707, A255366, the positive elements of the columns k, if k is a power of 2.

Michael De Vlieger, Table of n, a(n) for n = 1..16384
Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Identities and periodic oscillations of divide-and-conquer recurrences splitting at half, arXiv:2210.10968 [cs.DS], 2022, p. 37.
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to cellular automata
Index entries for sequences related to the Josephus Problem

Cf. A002450, A006257, A011782, A139250, A147562, A160720, A162795, A169707, A246335, A255366, A256138, A256249, A256251.

1 + 4*Accumulate@ Prepend[Flatten@ Table[Range[1, 2^n - 1, 2], {n, 0, 7}], 0] (* Michael De Vlieger, Nov 03 2022, after Ivan N. Ianakiev at A256249 *)

a(n) = 1 + 4*A256249(n-1), n >= 1.

cp's OEIS Frontend

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

Extensions

A088442 A linear version of the Josephus problem.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Python

SageMath

Formula

Extensions

A360099 To get A(n,k), replace 0's in the binary expansion of n with (-1) and interpret the result in base k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula

A049937 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Formula

Extensions

A049940 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1) with a(1) = a(2) = 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A049945 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Formula

Extensions

A049960 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), with a(1) = 1 and a(2) = 2.

Views

Author

Keywords

Crossrefs

Programs

Maple

Formula

Extensions

A256263 Triangle read by rows: T(j,k) = 2*k-1 if k is a power of 2, otherwise, between positions that are powers of 2 we have the initial terms of A016969, with j>=0, 1<=k<=A011782(j) and T(0,1) = 0.