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

A153286 a(n) = n^3 + sum((-1)^j*a(j)); for j=1 to n-1; a(1)=1.

Original entry on oeis.org

1, 7, 33, 37, 135, 91, 309, 169, 555, 271, 873, 397, 1263, 547, 1725, 721, 2259, 919, 2865, 1141, 3543, 1387, 4293, 1657, 5115, 1951, 6009, 2269, 6975, 2611, 8013, 2977, 9123, 3367, 10305, 3781, 11559, 4219, 12885, 4681, 14283, 5167, 15753, 5677, 17295
Offset: 1

Views

Author

Walter Carlini, Dec 23 2008, Jan 01 2009

Keywords

Comments

1 followed by interleaving of A154105 and 3*A154106. - Klaus Brockhaus, Jan 04 2009

Examples

			a(1)=1, a(2)=2^3-a(1)=8-1=7, a(3)=3^3+a(2)-a(1)=27+7-1=33, a(4)=64-33+7-1=37, a(5)=125+37-33+7-1=135, a(6)=216-135+37-33+7-1=91, etc.

Crossrefs

The third of a family of sequences that includes A153284 and A153285.
Cf. A154105 (12*n^2 + 18*n + 7), A154106 (12*n^2 + 22*n + 11). - Klaus Brockhaus, Jan 04 2009

Programs

  • Magma
    S:=[ 1 ]; for n in [2..45] do Append(~S, n^3 + &+[ (-1)^j*S[j]: j in [1..n-1] ]); end for; S; // Klaus Brockhaus, Jan 04 2009

Formula

G.f.: x*(1 + 7*x + 30*x^2 + 16*x^3 + 39*x^4 + x^5 + 2*x^6)/((1+x)^3*(1-x)^3). - Klaus Brockhaus, Jan 04 2009
From Walter Carlini, Jan 12 2009: (Start)
a(n) = 3n^2 - 3n + 1 if n is 1 or an even number;
a(n) = 9n^2 - 21n + 15 if n is any odd number other than 1. (End)

Extensions

Extended beyond a(30) by Klaus Brockhaus, Jan 04 2009
G.f. corrected by Klaus Brockhaus, Oct 15 2009

A194454 a(n) = 12*n^2 + 2*n + 1.

Original entry on oeis.org

1, 15, 53, 115, 201, 311, 445, 603, 785, 991, 1221, 1475, 1753, 2055, 2381, 2731, 3105, 3503, 3925, 4371, 4841, 5335, 5853, 6395, 6961, 7551, 8165, 8803, 9465, 10151, 10861, 11595, 12353, 13135, 13941, 14771, 15625, 16503, 17405, 18331, 19281
Offset: 0

Views

Author

Bruno Berselli, Aug 24 2011

Keywords

Comments

A142241 gives the first differences.
Inverse binomial transform of this sequence: 1, 14, 24, 0, 0 (0 continued).
a(n)*a(n-1)-11 is a square, precisely 4*A051866(n)^2.
Sequence found by reading the line from 1, in the direction 1, 15, ..., in the square spiral whose vertices are the generalized octagonal numbers A001082. - Omar E. Pol, Jul 18 2012

Examples

			Using these numbers we can write:
  1, 15, 53, 115, 201, 311, 445,  603,  785,  991, 1221, ...
  0,  0,  1,  15,  53, 115, 201,  311,  445,  603,  785, ...
  0,  0,  0,   0,   1,  15,  53,  115,  201,  311,  445, ...
  0,  0,  0,   0,   0,   0,   1,   15,   53,  115,  201, ...
  0,  0,  0,   0,   0,   0,   0,    0,    1,   15,   53, ...
  0,  0,  0,   0,   0,   0,   0,    0,    0,    0,    1, ...
  ======================================================
  The sums of the columns give the sequence A172073 (after 0):
  1, 15, 54, 130, 255, 441, 700, 1044, 1485, 2035, 2706, ...

Links

Crossrefs

Cf. A154106, A172073, A049453.

Programs

  • Magma
    [12*n^2+2*n+1: n in [0..40]];
  • Mathematica
    Table[12 n^2 + 2 n + 1, {n, 0, 50}] (* Vincenzo Librandi, Mar 26 2013 *)
  • PARI
    for(n=0, 40, print1(12*n^2+2*n+1", "));

Formula

G.f.: (1+x)*(1+11*x)/(1-x)^3.
a(n) = A154106(-n-1).
a(n) = 2*A049453(n) + 1.
a(n) = A051866(n) + A051866(n+1). - Charlie Marion, Nov 15 2019
E.g.f.: exp(x)*(1 + 14*x + 12*x^2). - Stefano Spezia, Nov 15 2019

A185918 a(n) = 12*n^2 - 2*n - 1.

Original entry on oeis.org

-1, 9, 43, 101, 183, 289, 419, 573, 751, 953, 1179, 1429, 1703, 2001, 2323, 2669, 3039, 3433, 3851, 4293, 4759, 5249, 5763, 6301, 6863, 7449, 8059, 8693, 9351, 10033, 10739, 11469, 12223, 13001, 13803, 14629, 15479, 16353, 17251, 18173, 19119, 20089, 21083, 22101, 23143, 24209
Offset: 0

Views

Author

Paul Curtz, Feb 08 2011

Keywords

Comments

The second quadrisection of A184005(n-1) is A179741(n).
The first quadrisection of A184005(n-1) is a(n).
Sequence found by reading the line from -1, in the direction -1, 9, ..., in the square spiral whose vertices are -1 together with the generalized octagonal numbers A001082. - Omar E. Pol, Jul 18 2012

Links

Crossrefs

Cf. A001082, A154106, A179741, A184005.

Programs

Formula

a(n) = A184005(4*n-1). [corrected by R. J. Mathar, Aug 24 2011]
a(n) = a(n-1) + 24*n - 14.
a(n) = 2*a(n-1) - a(n) + 24.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: -(1+x)*(13*x-1) / (x-1)^3. - R. J. Mathar, Aug 24 2011
a(n) = A154106(n-1) - 2, n >= 1. - Omar E. Pol, Jul 19 2012
E.g.f.: (12*x^2 + 10*x -1)*exp(x). - G. C. Greubel, Jul 22 2017

Extensions

More terms from Vincenzo Librandi, Feb 09 2011

A303273 Array T(n,k) = binomial(n, 2) + k*n + 1 read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 1, 3, 4, 4, 1, 4, 6, 7, 7, 1, 5, 8, 10, 11, 11, 1, 6, 10, 13, 15, 16, 16, 1, 7, 12, 16, 19, 21, 22, 22, 1, 8, 14, 19, 23, 26, 28, 29, 29, 1, 9, 16, 22, 27, 31, 34, 36, 37, 37, 1, 10, 18, 25, 31, 36, 40, 43, 45, 46, 46, 1, 11, 20, 28, 35, 41
Offset: 0

Views

Author

Franck Maminirina Ramaharo, Apr 20 2018

Keywords

Comments

Columns are linear recurrence sequences with signature (3,-3,1).
8*T(n,k) + A166147(k-1) are squares.
Columns k are binomial transforms of [1, k, 1, 0, 0, 0, ...].
Antidiagonals sums yield A116731.

Examples

			The array T(n,k) begins
1    1    1    1    1    1    1    1    1    1    1    1    1  ...  A000012
1    2    3    4    5    6    7    8    9   10   11   12   13  ...  A000027
2    4    6    8   10   12   14   16   18   20   22   24   26  ...  A005843
4    7   10   13   16   19   22   25   28   31   34   37   40  ...  A016777
7   11   15   19   23   27   31   35   39   43   47   51   55  ...  A004767
11  16   21   26   31   36   41   46   51   56   61   66   71  ...  A016861
16  22   28   34   40   46   52   58   64   70   76   82   88  ...  A016957
22  29   36   43   50   57   64   71   78   85   92   99  106  ...  A016993
29  37   45   53   61   69   77   85   93  101  109  117  125  ...  A004770
37  46   55   64   73   82   91  100  109  118  127  136  145  ...  A017173
46  56   66   76   86   96  106  116  126  136  146  156  166  ...  A017341
56  67   78   89  100  111  122  133  144  155  166  177  188  ...  A017401
67  79   91  103  115  127  139  151  163  175  187  199  211  ...  A017605
79  92  105  118  131  144  157  170  183  196  209  222  235  ...  A190991
...
The inverse binomial transforms of the columns are
1    1    1    1    1    1    1    1    1    1    1    1    1  ...
0    1    2    3    4    5    6    7    8    9   10   11   12  ...
1    1    1    1    1    1    1    1    1    1    1    1    1  ...
0    0    0    0    0    0    0    0    0    0    0    0    0  ...
0    0    0    0    0    0    0    0    0    0    0    0    0  ...
0    0    0    0    0    0    0    0    0    0    0    0    0  ...
...
T(k,n-k) = A087401(n,k) + 1 as triangle
1
1   1
1   2   2
1   3   4   4
1   4   6   7   7
1   5   8  10  11  11
1   6  10  13  15  16  16
1   7  12  16  19  21  22  22
1   8  14  19  23  26  28  29  29
1   9  16  22  27  31  34  36  37  37
1  10  18  25  31  36  40  43  45  46  46
...

References

  • R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 1994.

Crossrefs

Cf. A085475, A086270, A086271, A086272, A086273, A130154, A159798, A162609, A162610, A300401.

Programs

  • Maple
    T := (n, k) -> binomial(n, 2) + k*n + 1;
for n from 0 to 20 do seq(T(n, k), k = 0 .. 20) od;
  • Mathematica
    Table[With[{n = m - k}, Binomial[n, 2] + k n + 1], {m, 0, 11}, {k, m, 0, -1}] // Flatten (* Michael De Vlieger, Apr 21 2018 *)
  • Maxima
    T(n, k) := binomial(n, 2)+ k*n + 1$
for n:0 thru 20 do
    print(makelist(T(n, k), k, 0, 20));
  • PARI
    T(n,k) = binomial(n, 2) + k*n + 1;
tabl(nn) = for (n=0, nn, for (k=0, nn, print1(T(n, k), ", ")); print); \\ Michel Marcus, May 17 2018

Formula

G.f.: (3*x^2*y - 3*x*y + y - 2*x^2 + 2*x - 1)/((x - 1)^3*(y - 1)^2).
E.g.f.: (1/2)*(2*x*y + x^2 + 2)*exp(y + x).
T(n,k) = 3*T(n-1,k) - 3*T(n-2,k) + T(n-3,k), with T(0,k) = 1, T(1,k) = k + 1 and T(2,k) = 2*k + 2.
T(n,k) = T(n-1,k) + n + k - 1.
T(n,k) = T(n,k-1) + n, with T(n,0) = 1.
T(n,0) = A152947(n+1).
T(n,1) = A000124(n).
T(n,2) = A000217(n).
T(n,3) = A034856(n+1).
T(n,4) = A052905(n).
T(n,5) = A051936(n+4).
T(n,6) = A246172(n+1).
T(n,7) = A302537(n).
T(n,8) = A056121(n+1) + 1.
T(n,9) = A056126(n+1) + 1.
T(n,10) = A051942(n+10) + 1, n > 0.
T(n,11) = A101859(n) + 1.
T(n,12) = A132754(n+1) + 1.
T(n,13) = A132755(n+1) + 1.
T(n,14) = A132756(n+1) + 1.
T(n,15) = A132757(n+1) + 1.
T(n,16) = A132758(n+1) + 1.
T(n,17) = A212427(n+1) + 1.
T(n,18) = A212428(n+1) + 1.
T(n,n) = A143689(n) = A300192(n,2).
T(n,n+1) = A104249(n).
T(n,n+2) = T(n+1,n) = A005448(n+1).
T(n,n+3) = A000326(n+1).
T(n,n+4) = A095794(n+1).
T(n,n+5) = A133694(n+1).
T(n+2,n) = A005449(n+1).
T(n+3,n) = A115067(n+2).
T(n+4,n) = A133694(n+2).
T(2*n,n) = A054556(n+1).
T(2*n,n+1) = A054567(n+1).
T(2*n,n+2) = A033951(n).
T(2*n,n+3) = A001107(n+1).
T(2*n,n+4) = A186353(4*n+1) (conjectured).
T(2*n,n+5) = A184103(8*n+1) (conjectured).
T(2*n,n+6) = A250657(n-1) = A250656(3,n-1), n > 1.
T(n,2*n) = A140066(n+1).
T(n+1,2*n) = A005891(n).
T(n+2,2*n) = A249013(5*n+4) (conjectured).
T(n+3,2*n) = A186384(5*n+3) = A186386(5*n+3) (conjectured).
T(2*n,2*n) = A143689(2*n).
T(2*n+1,2*n+1) = A143689(2*n+1) (= A030503(3*n+3) (conjectured)).
T(2*n,2*n+1) = A104249(2*n) = A093918(2*n+2) = A131355(4*n+1) (= A030503(3*n+5) (conjectured)).
T(2*n+1,2*n) = A085473(n).
a(n+1,5*n+1)=A051865(n+1) + 1.
a(n,2*n+1) = A116668(n).
a(2*n+1,n) = A054569(n+1).
T(3*n,n) = A025742(3*n-1), n > 1 (conjectured).
T(n,3*n) = A140063(n+1).
T(n+1,3*n) = A069099(n+1).
T(n,4*n) = A276819(n).
T(4*n,n) = A154106(n-1), n > 0.
T(2^n,2) = A028401(n+2).
T(1,n)*T(n,1) = A006000(n).
T(n*(n+1),n) = A211905(n+1), n > 0 (conjectured).
T(n*(n+1)+1,n) = A294259(n+1).
T(n,n^2+1) = A081423(n).
T(n,A000217(n)) = A158842(n), n > 0.
T(n,A152947(n+1)) = A060354(n+1).
floor(T(n,n/2)) = A267682(n) (conjectured).
floor(T(n,n/3)) = A025742(n-1), n > 0 (conjectured).
floor(T(n,n/4)) = A263807(n-1), n > 0 (conjectured).
ceiling(T(n,2^n)/n) = A134522(n), n > 0 (conjectured).
ceiling(T(n,n/2+n)/n) = A051755(n+1) (conjectured).
floor(T(n,n)/n) = A133223(n), n > 0 (conjectured).
ceiling(T(n,n)/n) = A007494(n), n > 0.
ceiling(T(n,n^2)/n) = A171769(n), n > 0.
ceiling(T(2*n,n^2)/n) = A046092(n), n > 0.
ceiling(T(2*n,2^n)/n) = A131520(n+2), n > 0.
Showing 1-4 of 4 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.