A256250 -id:A256250 - cp's OEIS frontend

A256251 First differences of A256250.

1, 4, 4, 12, 4, 12, 20, 28, 4, 12, 20, 28, 36, 44, 52, 60, 4, 12, 20, 28, 36, 44, 52, 60, 68, 76, 84, 92, 100, 108, 116, 124, 4, 12, 20, 28, 36, 44, 52, 60, 68, 76, 84, 92, 100, 108, 116, 124, 132, 140, 148, 156, 164, 172, 180, 188, 196, 204, 212, 220, 228, 236, 244, 252, 4, 12, 20, 28, 36, 44, 52, 60, 68, 76, 84, 92, 100

Offset: 0

Omar E. Pol, Mar 20 2015

Number of cells turned ON at n-th stage in the structure of A256250.

Apart from the initial 1, four times A006257 (Josephus problem).

			Written as an irregular triangle in which the row lengths are the terms of A011782, the sequence begins:
1;
4;
4,12;
4,12,20,28;
4,12,20,28,36,44,52,60;
4,12,20,28,36,44,52,60,68,76,84,92,100,108,116,124;
4,12,20,28,36,44,52,60,68,76,84,92,100,108,116,124,132,140,148,156,164,172,180,188,196,204,212,220,228,236,244,252;
...
Row sums give A000302.
Right border gives A173033.

Danny Rorabaugh, Table of n, a(n) for n = 0..10000
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. A000302, A006257, A011782, A028399, A139251, A147582, A162793, A169708, A256239.

a(n) = if(n, 8*(n - 2^logint(n,2)) + 4, 1)

[1] + [8*(n - 2^floor(log(n,base=2))) + 4 for n in range(1,77)] # Danny Rorabaugh, Apr 20 2015

a(0) = 1. For n >= 1; a(n) = 4*A006257(n).

For n>0, a(n) = 8*(n - 2^floor(log_2(n))) + 4 (by the formula of Gregory Pat Scandalis in A006257). - Danny Rorabaugh, Apr 20 2015

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

Original entry on oeis.org

1, 5, 9, 21, 25, 37, 57, 85, 89, 101, 121, 149, 169, 213, 281, 341, 345, 357, 377, 405, 425, 469, 537, 597, 617, 661, 729, 821, 937, 1077, 1241, 1365, 1369, 1381, 1401, 1429, 1449, 1493, 1561, 1621, 1641, 1685, 1753, 1845, 1961, 2101, 2265, 2389, 2409, 2453, 2521, 2613, 2729, 2869, 3033, 3221, 3433, 3669, 3929, 4213, 4521, 4853, 5209, 5461

Offset: 1

Omar E. Pol, Mar 28 2015

First differs from A169707 at a(28).
Compare A169707. It appears that both sequences share infinitely many terms, for example: a(1)..a(27), a(31)..a(43), a(47)..a(51), etc.
See also the conjecture in the Example section.
The main entry for this sequence is A256263.
A256261 gives the number of cells turned ON at n-th stage.

			Written as an irregular triangle T(j,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,169,213,281,341;
345,357,377,405,425,469,537,597,617,661,729,821,937,1077,1241,1365;
...
The 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, A256250, the positive elements of the columns k, if k is a power of 2.

Cf. A002450, A139250, A147562, A162795, A169707, A255264, A255366, A256250, A256258, A256261, A256263, A256264, A256265.

a(n) = 1 + 4*A256264(n-1).

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

A256249 Partial sums of A006257 (Josephus problem).

Original entry on oeis.org

0, 1, 2, 5, 6, 9, 14, 21, 22, 25, 30, 37, 46, 57, 70, 85, 86, 89, 94, 101, 110, 121, 134, 149, 166, 185, 206, 229, 254, 281, 310, 341, 342, 345, 350, 357, 366, 377, 390, 405, 422, 441, 462, 485, 510, 537, 566, 597, 630, 665, 702, 741, 782, 825, 870, 917, 966, 1017, 1070, 1125, 1182, 1241, 1302, 1365, 1366, 1369, 1374

Offset: 0

Omar E. Pol, Mar 20 2015

Also total number of ON states after n generations in one of the four wedges of the one-step rook version (or in one of the four quadrants of the one-step bishop version) of the cellular automaton of A256250.
A006257 gives the number of cells turned ON at n-th stage.
First differs from A255747 at a(11).
First differs from A169779 at a(10).
It appears that the odd terms (a bisection) give A256250.

			Written as an irregular triangle T(n,k), k >= 1, in which the row lengths are the terms of A011782 the sequence begins:
   0;
   1;
   2,  5;
   6,  9, 14, 21;
  22, 25, 30, 37, 46, 57, 70, 85;
  86, 89, 94,101,110,121,134,149,166,185,206,229,254,281,310,341;
  ...
Right border, a(2^m-1), gives A002450(m) for m >= 0.
a(2^m-2) = A203241(m) for m >= 2.
It appears that this triangle at least shares with the triangles from the following sequences; A151920, A255737, A255747, the positive elements of the columns k, if k is a power of 2.
From _Omar E. Pol_, Jan 03 2016: (Start)
Illustration of initial terms in the fourth quadrant of the square grid:
---------------------------------------------------------------------------
n    a(n)                 Compact diagram
---------------------------------------------------------------------------
0     0     _
1     1    |_|_ _
2     2      |_| |
3     5      |_ _|_ _ _ _
4     6          |_| | | |
5     9          |_ _| | |
6    14          |_ _ _| |
7    21          |_ _ _ _|_ _ _ _ _ _ _ _
8    22                  |_| | | | | | | |
9    25                  |_ _| | | | | | |
10   30                  |_ _ _| | | | | |
11   37                  |_ _ _ _| | | | |
12   46                  |_ _ _ _ _| | | |
13   57                  |_ _ _ _ _ _| | |
14   70                  |_ _ _ _ _ _ _| |
15   85                  |_ _ _ _ _ _ _ _|
.
a(n) is also the total number of cells in the first n regions of the diagram. A006257(n) gives the number of cells in the n-th region of the diagram.
(End)

David A. Corneth, Table of n, a(n) for n = 0..9999
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, pp. 37, 41.
Yuri Nikolayevsky and Ioannis Tsartsaflis, Cohomology of N-graded Lie algebras of maximal class over Z_2, arXiv:1512.87676 [math.RA], (2016), page 6.
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, A151920, A169779, A255737, A255747, A256250, A256251, A266540.

(* Based on Birkas Gyorgy's code in A006257 *)
Accumulate[Prepend[Flatten[Table[Range[1,2^n-1,2],{n,0,7}]],0]] (* Ivan N. Ianakiev, Mar 30 2015 *)

a(n)=n++;b=#binary(n>>1);(4^b-1)/3+(n-2^b)^2 \\ David A. Corneth, Mar 21 2015

a(n) = (A256250(n+1) - 1)/4.

A255264 Total number of ON cells in the "Ulam-Warburton" two-dimensional cellular automaton of A147562 after A048645(n) generations.

Original entry on oeis.org

1, 5, 9, 21, 25, 37, 85, 89, 101, 149, 341, 345, 357, 405, 597, 1365, 1369, 1381, 1429, 1621, 2389, 5461, 5465, 5477, 5525, 5717, 6485, 9557, 21845, 21849, 21861, 21909, 22101, 22869, 25941, 38229, 87381, 87385, 87397, 87445, 87637

Offset: 1

Omar E. Pol, Feb 19 2015

It appears that these are the terms of A147562, A162795, A169707, A255366, A256250, A256260, whose indices have binary weight 1 or 2.

			Also, written as an irregular triangle in which row lengths are the terms of A028310 the sequence begins:
      1;
      5;
      9,    21;
     25,    37,    85;
     89,   101,   149,   341;
    345,   357,   405,   597,  1365;
   1369,  1381,  1429,  1621,  2389,  5461;
   5465,  5477,  5525,  5717,  6485,  9557, 21845;
  21849, 21861, 21909, 22101, 22869, 25941, 38229, 87381;
  ...
Right border gives the positive terms of A002450.
It appears that the second leading diagonal gives the odd terms of A206374.

Cf. A002450, A028310, A032925, A048645, A075897, A139250, A147562, A162795, A169707, A206374, A209492, A255263, A255366, A256250, A256260.

a(n) = A147562(A048645(n)).
Conjecture 1: a(n) = A162795(A048645(n)).
Conjecture 2: a(n) = A169707(A048645(n)).
Conjecture 3: a(n) = A255366(A048645(n)).
Conjecture 4: a(n) = A256250(A048645(n)).
Conjecture 5: a(n) = A256260(A048645(n)).
a(n) = A032925(A209492(n-1)) (conjectured). - Jon Maiga, Dec 17 2021

A288775 Difference between the total number of toothpicks in the toothpick structure of A139250 that are parallel to the initial toothpick after n odd stages, and the total number of "ON" cells at n-th stage in the "Ulam-Warburton" two-dimensional cellular automaton of A147562.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 4, 4, 28, 0, 0, 0, 4, 0, 4, 4, 28, 0, 4, 4, 28, 4, 28, 32, 132, 0, 0, 0, 4, 0, 4, 4, 28, 0, 4, 4, 28, 4, 28, 32, 132, 0, 4, 4, 28, 4, 28, 32, 132, 4, 28, 32, 132, 32, 136, 176, 524, 0, 0, 0, 4, 0, 4, 4, 28, 0, 4, 4, 28, 4, 28, 32, 132, 0, 4, 4, 28, 4, 28, 32, 132, 4, 28, 32

Offset: 1

Omar E. Pol, Jul 04 2017

It appears that a(n) = 0 if and only if n is a member of A048645.
First differs from A255263 at a(14), with which it shares infinitely many terms.
It appears that A147562(n) = A162795(n) = A169707(n) = A255366(n) = A256250(n) = A256260(n), if n is a member of A048645.

			Written as an irregular triangle T(j,k), k>=1, in which the row lengths are the terms of A011782, the sequence begins:
0;
0;
0,0;
0,0,4,0;
0,0,4,0,4,4,28,0;
0,0,4,0,4,4,28,0,4,4,28,4,28,32,132,0;
0,0,4,0,4,4,28,0,4,4,28,4,28,32,132,0,4,4,28,4,28,32,132,4,28,32,132,32,136,176,524,0;
...
It appears that if k is a power of 2 then T(j,k) = 0.
It appears that every column lists the same terms as its initial term.

Cf. A011782, A048645, A139250, A139251, A147562, A147582, A162793, A162795, A169707, A255263, A255366, A256250, A256260.

a(n) = A162795(n) - A147562(n).

cp's OEIS Frontend

A256251 First differences of A256250.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Sage

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A256249 Partial sums of A006257 (Josephus problem).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A255264 Total number of ON cells in the "Ulam-Warburton" two-dimensional cellular automaton of A147562 after A048645(n) generations.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A288775 Difference between the total number of toothpicks in the toothpick structure of A139250 that are parallel to the initial toothpick after n odd stages, and the total number of "ON" cells at n-th stage in the "Ulam-Warburton" two-dimensional cellular automaton of A147562.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula