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-2 of 2 results.

A321002 a(0)=3; thereafter a(n) = 20*6^(n-1)-2^(n-1).

Original entry on oeis.org

3, 19, 118, 716, 4312, 25904, 155488, 933056, 5598592, 33592064, 201553408, 1209322496, 7255939072, 43535642624, 261213872128, 1567283265536, 9403699658752, 56422198083584, 338533188763648, 2031199133106176, 12187194799685632, 73123168800210944, 438739012805459968, 2632434076841148416
Offset: 0

Views

Author

N. J. A. Sloane, Nov 01 2018

Keywords

Comments

Conjectured to be the sum of A175046(i) for 2^n <= i < 2^(n+1).
Conjecture is true (see comments in A175046). - Chai Wah Wu, Nov 18 2018

Crossrefs

Essentially the first differences of A321003.
Cf. A175046.

Programs

  • PARI
    Vec((1 - x)*(3 - 2*x) / ((1 - 2*x)*(1 - 6*x)) + O(x^25)) \\ Colin Barker, Nov 02 2018
    
  • PARI
    a(n) = if (n, 20*6^(n-1)-2^(n-1), 3); \\ Michel Marcus, Nov 02 2018

Formula

From Colin Barker, Nov 02 2018: (Start)
G.f.: (1 - x)*(3 - 2*x) / ((1 - 2*x)*(1 - 6*x)).
a(n) = 8*a(n-1) - 12*a(n-2) for n>2.
(End)

A385178 Triangle T(n,k) read by rows in which the n-th diagonal lists the n-th differences of A001047, 0 <= k <= n.

Original entry on oeis.org

0, 1, 1, 3, 4, 5, 7, 10, 14, 19, 15, 22, 32, 46, 65, 31, 46, 68, 100, 146, 211, 63, 94, 140, 208, 308, 454, 665, 127, 190, 284, 424, 632, 940, 1394, 2059, 255, 382, 572, 856, 1280, 1912, 2852, 4246, 6305, 511, 766, 1148, 1720, 2576, 3856, 5768, 8620, 12866, 19171
Offset: 0

Views

Author

Paul Curtz, Jun 20 2025

Keywords

Examples

			Triangle begins:
    0;
    1,   1;
    3,   4,    5;
    7,  10,   14,   19;
   15,  22,   32,   46,   65;
   31,  46,   68,  100,  146,  211;
   63,  94,  140,  208,  308,  454,  665;
  127, 190,  284,  424,  632,  940, 1394, 2059;
  255, 382,  572,  856, 1280, 1912, 2852, 4246,  6305;
  511, 766, 1148, 1720, 2576, 3856, 5768, 8620, 12866, 19171;
  ...
		

Crossrefs

Columns k=0..2: A000225, A033484, A053209 (sans 1).
Diagonals: A001047, A027649, A053581 (sans 1), A291012 (sans 2).

Programs

  • Magma
    /* As triangle */ [[2^(n-k)*3^k - 2^k : k in [0..n]]: n in [0..9]]; // Vincenzo Librandi, Jun 27 2025
  • Maple
    T:= proc(n,k) option remember;
         `if`(n=k, 3^n-2^n, T(n, k+1)-T(n-1, k))
        end:
    seq(seq(T(n, k), k=0..n), n=0..10);  # Alois P. Heinz, Jun 24 2025
  • Mathematica
    t[n_, 0] := 3^n - 2^n; t[n_, k_] := t[n, k] = t[n + 1, k - 1] - t[n, k - 1]; Table[t[k, n - k], {n, 0, 9}, {k, 0, n}] // Flatten (* Amiram Eldar, Jun 20 2025 *)

Formula

T(n,n) = 3^n - 2^n = A001047(n).
T(n,k) = T(n,k+1) - T(n-1,k) for 0 <= k < n.
T(n,k) = 2^(n-k)*3^k - 2^k = A036561(n,k) - A059268(n,k).
T(2n,n) = A248216(n+1).
Showing 1-2 of 2 results.