cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

A160417 a(n) = A160415(n+1)/4.

Original entry on oeis.org

2, 1, 7, 1, 7, 3, 21, 1, 7, 3, 21, 3, 21, 9, 63, 1, 7, 3, 21, 3, 21, 9, 63, 3, 21, 9, 63, 9, 63, 27, 189, 1, 7, 3, 21, 3, 21, 9, 63, 3, 21, 9, 63, 9, 63, 27, 189, 3, 21, 9, 63, 9, 63, 27, 189, 9, 63, 27, 189, 27, 189, 81, 567, 1, 7, 3, 21, 3, 21, 9, 63, 3, 21
Offset: 1

Views

Author

Omar E. Pol, Jun 13 2009

Keywords

Crossrefs

Cf. A152978, A160118, A160413, A160415.

Programs

  • Mathematica
    With[{d = 2}, wt[n_] := DigitCount[n, 2, 1]; f[n_] := If[OddQ[n], 3^d + (2^d) * Sum[(2^d - 1)^(wt[k] - 1), {k, 1, (n - 1)/2}] + (2^d)*(3^d - 2) * Sum[(2^d - 1)^(wt[k] - 1), {k, 1, (n - 3)/2}], 3^d + (2^d) * Sum[(2^d - 1)^(wt[k] - 1), {k, 1, n/2 - 1}] + (2^d)*(3^d - 2) * Sum[(2^d - 1)^(wt[k] - 1), {k, 1, n/2 - 1}]]; f[0] = 0; f[1] = 1; Differences[Array[f, 100]]/4] (* Amiram Eldar, Feb 02 2024 *)

Extensions

More terms from Max Alekseyev, Dec 12 2011
More terms from Amiram Eldar, Feb 02 2024

A160118 Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition).

Original entry on oeis.org

0, 1, 9, 13, 41, 45, 73, 85, 169, 173, 201, 213, 297, 309, 393, 429, 681, 685, 713, 725, 809, 821, 905, 941, 1193, 1205, 1289, 1325, 1577, 1613, 1865, 1973, 2729, 2733, 2761, 2773, 2857, 2869, 2953, 2989, 3241, 3253, 3337, 3373, 3625, 3661, 3913, 4021, 4777, 4789
Offset: 0

Views

Author

Omar E. Pol, May 05 2009

Keywords

Comments

On the infinite square grid, we start at stage 0 with all square cells in the OFF state.
Define a "peninsula cell" to a cell that is connected to the structure by exactly one of its vertices.
At stage 1 we turn ON a single cell in the central position.
For n>1, if n is even, at stage n we turn ON all the OFF neighboring cells from cells that were turned in ON at stage n-1.
For n>1, if n is odd, at stage n we turn ON all the peninsular OFF cells.
For the corresponding corner sequence, see A160796.
An animation will show the fractal-like behavior (cf. A139250).
For the first differences see A160415. - Omar E. Pol, Mar 21 2011
First differs from A188343 at a(13). - Omar E. Pol, Mar 28 2011

Examples

			If we label the generations of cells turned ON by consecutive numbers we get the cell pattern shown below:
9...............9
.888.888.888.888.
.878.878.878.878.
.8866688.8866688.
...656.....656...
.8866444.4446688.
.878.434.434.878.
.888.4422244.888.
.......212.......
.888.4422244.888.
.878.434.434.878.
.8866444.4446688.
...656.....656...
.8866688.8866688.
.878.878.878.878.
.888.888.888.888.
9...............9
In the first generation, only the central "1" is ON, a(1)=1. In the next generation, we turn ON eight "2" around the central cell, leading to a(2)=a(1)+8=9. In the third generation, four "3" are turned ON at the vertices of the square, a(3)=a(2)+4=13. And so on...

Links

Crossrefs

Cf. A139250, A139251, A147562, A147610, A160117, A160119, A160379, A160415, A160796, A188343.

Programs

  • Mathematica
    With[{d = 2}, wt[n_] := DigitCount[n, 2, 1]; a[n_] := If[OddQ[n], 3^d + (2^d)*Sum[(2^d - 1)^(wt[k] - 1), {k, 1, (n - 1)/2}] + (2^d)*(3^d - 2)*Sum[(2^d - 1)^(wt[k] - 1), {k, 1, (n - 3)/2}], 3^d + (2^d)*Sum[(2^d - 1)^(wt[k] - 1), {k, 1, n/2 - 1}] + (2^d)*(3^d - 2)*Sum[(2^d - 1)^(wt[k] - 1), {k, 1, n/2 - 1}]]; a[0] = 0; a[1] = 1; Array[a, 50, 0]] (* Amiram Eldar, Aug 01 2023 *)

Formula

From Nathaniel Johnston, Mar 24 2011: (Start)
a(2n-1) = 9 + 4*Sum_{k=2..n} A147610(k) + 28*Sum_{k=2..n-1} A147610(k), n >= 2.
a(2n) = 9 + 4*Sum_{k=2..n} A147610(k) + 28*Sum_{k=2..n} A147610(k), n >= 1.
(End)

Extensions

Entry revised by Omar E. Pol and N. J. A. Sloane, Feb 16 2010, Feb 21 2010
a(8) - a(38) from Nathaniel Johnston, Nov 06 2010
a(13) corrected at the suggestion of Sean A. Irvine. Then I corrected 19 terms between a(14) and a(38). Finally I added a(39)-a(42). - Omar E. Pol, Mar 21 2011
Rule, for n even, edited by Omar E. Pol, Mar 22 2011
Incorrect comment (in "formula" section) removed by Omar E. Pol, Mar 23 2011, with agreement of author.
More terms from Amiram Eldar, Aug 01 2023

A161411 First differences of A160410.

Original entry on oeis.org

4, 12, 12, 36, 12, 36, 36, 108, 12, 36, 36, 108, 36, 108, 108, 324, 12, 36, 36, 108, 36, 108, 108, 324, 36, 108, 108, 324, 108, 324, 324, 972, 12, 36, 36, 108, 36, 108, 108, 324, 36, 108, 108, 324, 108, 324, 324, 972, 36, 108, 108, 324, 108, 324, 324, 972, 108, 324, 324
Offset: 1

Views

Author

Omar E. Pol, May 20 2009, Jun 13 2009, Jun 14 2009

Keywords

Comments

The rows of the triangle in A147582 converge to this sequence.
Contribution from Omar E. Pol, Mar 28 2011 (Start):
a(n) is the number of cells turned "ON" at n-th stage of the cellular automaton of A160410.
a(n) is also the number of toothpicks added at n-th stage to the toothpick structure of A160410.
(End)

Examples

			If written as a triangle:
.4;
.12;
.12,36;
.12,36,36,108;
.12,36,36,108,36,108,108,324;

Links

Crossrefs

Cf. A139250, A139251, A160413, A160415, A160417.
Cf. A000079, A048883, A147582, A160410, A160414.

Programs

  • Mathematica
    4*3^DigitCount[Range[0,100],2,1] (* Paolo Xausa, Sep 01 2023 *)

Formula

a(n) = A048883(n-1)*4.

Extensions

Edited by David Applegate and N. J. A. Sloane, Jul 13 2009

A160411 Number of cells turned "ON" at n-th stage of A160117.

Original entry on oeis.org

1, 8, 4, 28, 8, 52, 12, 76, 16, 100, 20, 124, 24, 148, 28, 172, 32, 196, 36, 220, 40, 244, 44, 268, 48, 292, 52, 316, 56, 340, 60, 364, 64, 388, 68, 412, 72, 436, 76, 460, 80, 484, 84, 508, 88, 532, 92, 556, 96
Offset: 1

Views

Author

Omar E. Pol, Jun 13 2009

Keywords

Comments

First differences of A160117.
It appears that one of the bisections is A008574. - Omar E. Pol, Sep 20 2011

Links

Crossrefs

Cf. A139251, A160117, A160411, A160413, A160415.

Programs

  • Mathematica
    LinearRecurrence[{0,2,0,-1},{1,8,4,28,8,52},100] (* Paolo Xausa, Sep 01 2023 *)

Formula

G.f.: x*(x^2+1)*(4*x^3 + x^2 + 8*x + 1) / ((x-1)^2*(x+1)^2). - Colin Barker, Mar 04 2013
From Colin Barker, Apr 06 2013: (Start)
a(n) = -11 - 9*(-1)^n + (7 + 5*(-1)^n)*n for n > 2.
a(n) = 2*a(n-2) - a(n-4) for n > 6. (End)

Extensions

a(10)-a(27) from Omar E. Pol, Mar 26 2011
More terms from Colin Barker, Apr 06 2013

A162349 First differences of A160412.

Original entry on oeis.org

3, 9, 9, 27, 9, 27, 27, 81, 9, 27, 27, 81, 27, 81, 81, 243, 9, 27, 27, 81, 27, 81, 81, 243, 27, 81, 81, 243, 81, 243, 243, 729, 9, 27, 27, 81, 27, 81, 81, 243, 27, 81, 81, 243, 81, 243, 243, 729, 27, 81, 81, 243, 81, 243, 243, 729, 81, 243, 243, 729, 243, 729
Offset: 1

Views

Author

Omar E. Pol, Jul 14 2009

Keywords

Comments

Note that if A048883 is written as a triangle then rows converge to this sequence. - Omar E. Pol, Nov 15 2009

Links

Crossrefs

Cf. A063787, A152980, A160410, A160411, A160412, A160414, A160415, A160417, A160797.
Cf. A048883, A161415. - Omar E. Pol, Nov 15 2009

Programs

  • Mathematica
    a[n_] := 3^(1 + DigitCount[n - 1, 2, 1]); Array[a, 100] (* Amiram Eldar, Feb 02 2024 *)

Formula

a(n) = 3^A063787(n) = 3 * A048883(n-1). - Amiram Eldar, Feb 02 2024

Extensions

More terms from Omar E. Pol, Nov 15 2009
More terms from Colin Barker, Apr 19 2015
More terms from Amiram Eldar, Feb 02 2024

A161417 First differences of A160416.

Original entry on oeis.org

1, 7, 3, 21, 7, 41, 9, 57, 13
Offset: 1

Views

Author

Omar E. Pol, May 20 2009, Jun 14 2009

Keywords

Links

Crossrefs

Cf. A139250, A139251, A153006, A152980, A160411, A160413, A160415, A160416.
Cf. A160797.
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.