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.

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;
		

Crossrefs

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

A161415 First differences of A160414.

Original entry on oeis.org

1, 8, 12, 28, 12, 36, 36, 92, 12, 36, 36, 108, 36, 108, 108, 292, 12, 36, 36, 108, 36, 108, 108, 324, 36, 108, 108, 324, 108, 324, 324, 908, 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

Keywords

Crossrefs

Programs

  • Maple
    Contribution from R. J. Mathar, Oct 16 2010: (Start)
    isA000079 := proc(n) if type(n,'even') then nops(numtheory[factorset](n)) = 1 ; else false ; fi ; end proc:
    A048883 := proc(n) 3^wt(n) ; end proc:
    A161415 := proc(n) if n = 1 then 1; elif isA000079(n) then 4*A048883(n-1)-2*n ; else 4*A048883(n-1) ; end if; end proc: seq(A161415(n),n=1..90) ; (End)
  • Mathematica
    a[1] = 1; a[n_] := 4*3^DigitCount[n-1, 2, 1] - If[IntegerQ[Log[2, n]], 2n, 0];
    Array[a, 60] (* Jean-François Alcover, Nov 17 2017, after N. J. A. Sloane *)

Formula

For n > 1, a(n) = 4*A048883(n-1), except a(n) = 4*A048883(n-1) - 2n if n is a power of 2. - N. J. A. Sloane, Jul 13 2009

Extensions

More terms from R. J. Mathar, Oct 16 2010

A160413 a(n) = A160411(n+1)/4.

Original entry on oeis.org

2, 1, 7, 2, 13, 3, 19, 4, 25, 5, 31, 6, 37, 7, 43, 8, 49, 9, 55, 10, 61, 11, 67, 12, 73, 13, 79, 14, 85, 15, 91, 16, 97, 17, 103, 18, 109, 19, 115, 20, 121, 21, 127, 22, 133, 23, 139, 24, 145, 25, 151, 26, 157, 27, 163, 28, 169, 29, 175, 30, 181, 31, 187, 32, 193
Offset: 1

Views

Author

Omar E. Pol, Jun 13 2009

Keywords

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{0, 2, 0, -1}, {2, 1, 7, 2, 13}, 100] (* Amiram Eldar, Feb 02 2024 *)

Formula

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

Extensions

More terms from Colin Barker, Apr 06 2013
More terms from Amiram Eldar, Feb 02 2024

A160415 First differences of A160118.

Original entry on oeis.org

1, 8, 4, 28, 4, 28, 12, 84, 4, 28, 12, 84, 12, 84, 36, 252, 4, 28, 12, 84, 12, 84, 36, 252, 12, 84, 36, 252, 36, 252, 108, 756, 4, 28, 12, 84, 12, 84, 36, 252, 12, 84, 36, 252, 36, 252, 108, 756, 12, 84, 36, 252, 36, 252, 108, 756, 36, 252, 108, 756, 108, 756, 324
Offset: 1

Views

Author

Omar E. Pol, Jun 13 2009

Keywords

Comments

Number of cells turned "ON" at n-th stage of the cellular automaton of A160118.

Examples

			From _Omar E. Pol_, Mar 21 2011: (Start)
If written as a triangle begins:
1,
8,
4,28,
4,28,12,84,
4,28,12,84,12,84,36,252,
4,28,12,84,12,84,36,252,12,84,36,252,36,252,108,756,
(End)
		

Crossrefs

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, 0]]] (* Amiram Eldar, Feb 02 2024 *)

Extensions

More terms (a(8)-a(38)) from Nathaniel Johnston, Nov 14 2010
21 terms corrected between a(13) and a(38), and more terms (a(39)-a(48)) from Omar E. Pol, Mar 21 2011
More terms from Amiram Eldar, Feb 02 2024

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

Crossrefs

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

A160798 a(n) = A160797(n+2)/3.

Original entry on oeis.org

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, 9, 63
Offset: 1

Views

Author

Omar E. Pol, Jun 13 2009

Keywords

Comments

From Omar E. Pol, Mar 15 2020: (Start)
It appears that the right border of triangle gives A005032.
It appears that the sum of n-th row equals A004171(n). (End)
Apparently A160417 shifted once left. - R. J. Mathar, May 30 2025

Examples

			From _Omar E. Pol_, Mar 15 2020: (Start)
Written as an irregular triangle in which row lengths are the even powers of 2, the sequence begins:
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, ...
(End)
		

Crossrefs

Extensions

More terms from Jinyuan Wang, Mar 15 2020
Showing 1-6 of 6 results.