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

A188646 Array of a(n)=a(n-1)*k-((k-1)/(k^n)) where a(0)=1 and k=(sqrt(x^2-1)+x)^2 for integers x>=1.

Original entry on oeis.org

1, 1, 1, 1, 13, 1, 1, 181, 33, 1, 1, 2521, 1121, 61, 1, 1, 35113, 38081, 3781, 97, 1, 1, 489061, 1293633, 234361, 9505, 141, 1, 1, 6811741, 43945441, 14526601, 931393, 20021, 193, 1, 1, 94875313, 1492851361, 900414901, 91267009, 2842841, 37441, 253, 1
Offset: 0

Views

Author

Charles L. Hohn, Apr 06 2011

Keywords

Comments

Conjecture: Given function f(x, y)=(sqrt(x^2+y)+x)^2; constant k=f(x, y); and initial term a(0)=1; then for all integers x>=1 and y=[+-]1, k may be irrational, but sequence a(n)=a(n-1)*k-((k-1)/(k^n)) always produces integer sequences; y=-1 results shown here; y=1 results are A188647.
Also square array A(n,k), n >= 1, k >= 0, read by antidiagonals, where A(n,k) is (1/n) * T_{2*k+1}(n), with the Chebyshev polynomials of the first kind (type T). - Seiichi Manyama, Jan 01 2019

Examples

			Square array begins:
     | 0    1       2          3             4
-----+---------------------------------------------
   1 | 1,   1,      1,         1,            1, ...
   2 | 1,  13,    181,      2521,        35113, ...
   3 | 1,  33,   1121,     38081,      1293633, ...
   4 | 1,  61,   3781,    234361,     14526601, ...
   5 | 1,  97,   9505,    931393,     91267009, ...
   6 | 1, 141,  20021,   2842841,    403663401, ...
   7 | 1, 193,  37441,   7263361,   1409054593, ...
   8 | 1, 253,  64261,  16322041,   4145734153, ...
   9 | 1, 321, 103361,  33281921,  10716675201, ...
  10 | 1, 397, 158005,  62885593,  25028308009, ...
  11 | 1, 481, 231841, 111746881,  53861764801, ...
  12 | 1, 573, 328901, 188788601, 108364328073, ...
  13 | 1, 673, 453601, 305726401, 206059140673, ...
  14 | 1, 781, 610741, 477598681, 373481557801, ...
  15 | 1, 897, 805505, 723342593, 649560843009, ...
  ...
		

Crossrefs

Column 1 is A082109(n-1).
Cf. A188644, A188647 (f(x, y) as above with y=1).
Diagonal gives A322904.

Programs

Formula

A(n,k) = 2 * A188644(n,k) - A(n,k-1).
A(n,k) = Sum_{j=0..k} binomial(2*k+1,2*j+1)*(n^2-1)^(k-j)*n^(2*j). - Seiichi Manyama, Jan 01 2019

Extensions

Edited and extended by Seiichi Manyama, Jan 01 2019

A302329 a(0)=1, a(1)=61; for n>1, a(n) = 62*a(n-1) - a(n-2).

Original entry on oeis.org

1, 61, 3781, 234361, 14526601, 900414901, 55811197261, 3459393815281, 214426605350161, 13290990137894701, 823826961944121301, 51063980650397625961, 3165142973362708688281, 196187800367837541047461, 12160478479832564836254301, 753753477949251182306719201
Offset: 0

Views

Author

Bruno Berselli, Apr 05 2018

Keywords

Comments

Centered hexagonal numbers (A003215) with index in A145607. Example: 35 is a member of A145607, therefore A003215(35) = 3781 is a term of this sequence.
Also, centered 10-gonal numbers (A062786) with index in A182432. Example: 28 is a member of A182432 and A062786(28) = 3781.
a(n) is a solution to the Pell equation (4*a(n))^2 - 15*b(n)^2 = 1. The corresponding b(n) are A258684(n). - Klaus Purath, Jul 19 2025

Crossrefs

Fourth row of the array A188646.
First bisection of A041449, A042859.
Similar sequences of the type cosh((2*n+1)*arccosh(k))/k: A000012 (k=1), A001570 (k=2), A077420 (k=3), this sequence (k=4), A302330 (k=5), A302331 (k=6), A302332 (k=7), A253880 (k=8).

Programs

  • Mathematica
    LinearRecurrence[{62, -1}, {1, 61}, 20]
  • PARI
    x='x+O('x^99); Vec((1-x)/(1-62*x+x^2)) \\ Altug Alkan, Apr 06 2018

Formula

G.f.: (1 - x)/(1 - 62*x + x^2).
a(n) = a(-1-n).
a(n) = cosh((2*n + 1)*arccosh(4))/4.
a(n) = ((4 + sqrt(15))^(2*n + 1) + 1/(4 + sqrt(15))^(2*n + 1))/8.
a(n) = (1/4)*T(2*n+1, 4), where T(n,x) denotes the n-th Chebyshev polynomial of the first kind. - Peter Bala, Jul 08 2022
E.g.f.: exp(31*x)*(4*cosh(8*sqrt(15)*x) + sqrt(15)*sinh(8*sqrt(15)*x))/4. - Stefano Spezia, Jul 25 2025

A322904 a(n) = Sum_{k=0..n} binomial(2*n+1,2*k+1)*(n^2-1)^(n-k)*n^(2*k).

Original entry on oeis.org

1, 1, 181, 38081, 14526601, 8943235489, 8138661470941, 10287228590683393, 17254778510170993681, 37095265466946847758401, 99474891266913130060486021, 325534304813775692747248543681, 1276941308627620432293188401109401, 5914558735952850788377566338591400673
Offset: 0

Views

Author

Seiichi Manyama, Dec 30 2018

Keywords

Crossrefs

Programs

  • Magma
    [&+[Binomial(2*n+1,2*k+1)*(n^2-1)^(n-k)*n^(2*k): k in [0..n]]: n in [0..20]]; // Vincenzo Librandi, Jan 03 2019
  • Mathematica
    a[0] = 1; a[n_] := 1/n ChebyshevT[2n+1, n];
    Table[a[n], {n, 0, 13}] (* Jean-François Alcover, Jan 02 2019 *)
  • PARI
    {a(n) = sum(k=0, n, binomial(2*n+1, 2*k+1)*(n^2-1)^(n-k)*n^(2*k))}
    
  • PARI
    a(n) = if (n==0, 1, polchebyshev(2*n+1, 1, n)/n); \\ Michel Marcus, Jan 02 2019
    

Formula

For n > 0, a(n) = (1/n) * T_{2*n+1}(n) where T_{n}(x) is a Chebyshev polynomial of the first kind.
For n > 0, a(n) = (1/n) * cosh((2*n+1)*arccosh(n)).
a(n) ~ 4^n * n^(2*n). - Vaclav Kotesovec, Jan 03 2019
Showing 1-3 of 3 results.