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.

A063522 a(n) = n*(5*n^2 - 3)/2.

Original entry on oeis.org

0, 1, 17, 63, 154, 305, 531, 847, 1268, 1809, 2485, 3311, 4302, 5473, 6839, 8415, 10216, 12257, 14553, 17119, 19970, 23121, 26587, 30383, 34524, 39025, 43901, 49167, 54838, 60929, 67455, 74431, 81872, 89793, 98209, 107135, 116586, 126577, 137123, 148239, 159940
Offset: 0

Views

Author

N. J. A. Sloane, Aug 02 2001

Keywords

Crossrefs

(1/12)*t*(n^3 - n) + n for t = 2, 4, 6, ... gives A004006, A006527, A006003, A005900, A004068, A000578, A004126, A000447, A004188, A004466, A004467, A007588, A062025, A063521, A063522, A063523.
Bisections: A160674, A160699.

Programs

  • Magma
    [n*(5*n^2 -3)/2: n in [0..30]]; // G. C. Greubel, May 02 2018
  • Mathematica
    lst={};Do[AppendTo[lst, LegendreP[3, n]], {n, 10^2}];lst (* Vladimir Joseph Stephan Orlovsky, Sep 11 2008 *)
    CoefficientList[Series[x*(1 + 13*x + x^2)/(1-x)^4, {x, 0, 50}], x] (* G. C. Greubel, Sep 01 2017 *)
    LinearRecurrence[{4,-6,4,-1},{0,1,17,63},40] (* Harvey P. Dale, Sep 06 2023 *)
  • PARI
    a(n) = { n*(5*n^2 - 3)/2 } \\ Harry J. Smith, Aug 25 2009
    

Formula

G.f.: x*(1 + 13*x + x^2)/(1-x)^4. - Colin Barker, Jan 10 2012
E.g.f.: (x/2)*(2 + 15*x + 5*x^2)*exp(x). - G. C. Greubel, Sep 01 2017

A335333 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 2*(2*k+1)*x + x^2).

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 5, 13, 1, 1, 7, 37, 63, 1, 1, 9, 73, 305, 321, 1, 1, 11, 121, 847, 2641, 1683, 1, 1, 13, 181, 1809, 10321, 23525, 8989, 1, 1, 15, 253, 3311, 28401, 129367, 213445, 48639, 1, 1, 17, 337, 5473, 63601, 458649, 1651609, 1961825, 265729, 1
Offset: 0

Views

Author

Seiichi Manyama, Jun 02 2020

Keywords

Examples

			Square array begins:
  1,    1,     1,      1,      1,       1, ...
  1,    3,     5,      7,      9,      11, ...
  1,   13,    37,     73,    121,     181, ...
  1,   63,   305,    847,   1809,    3311, ...
  1,  321,  2641,  10321,  28401,   63601, ...
  1, 1683, 23525, 129367, 458649, 1256651, ...
		

Crossrefs

Columns k=0..4 give A000012, A001850, A006442, A084768, A084769.
Rows n=0..6 give A000012, A005408, A003154(n+1), A160674, A144124, A335338, A144126.
Main diagonal gives A331656.
T(n,n-1) gives A331657.

Programs

  • Mathematica
    T[n_, k_] := LegendreP[n, 2*k + 1]; Table[T[k, n - k], {n, 0, 9}, {k, 0, n}] // Flatten (* Amiram Eldar, May 03 2021 *)
  • PARI
    T(n, k) = pollegendre(n, 2*k+1);

Formula

T(n,k) is the coefficient of x^n in the expansion of (1 + (2*k+1)*x + k*(k+1)*x^2)^n.
T(n,k) = Sum_{j=0..n} k^j * (k+1)^(n-j) * binomial(n,j)^2.
T(n,k) = Sum_{j=0..n} k^j * binomial(n,j) * binomial(n+j,j).
n * T(n,k) = (2*k+1) * (2*n-1) * T(n-1,k) - (n-1) * T(n-2,k).
T(n,k) = P_n(2*k+1), where P_n is n-th Legendre polynomial.
From Seiichi Manyama, Aug 30 2025: (Start)
T(n,k) = (-1)^n * Sum_{j=0..n} (1/(2*(2*k+1)))^(n-2*j) * binomial(-1/2,j) * binomial(j,n-j).
T(n,k) = Sum_{j=0..floor(n/2)} (k*(k+1))^j * (2*k+1)^(n-2*j) * binomial(n,2*j) * binomial(2*j,j).
E.g.f. of column k: exp((2*k+1)*x) * BesselI(0, 2*sqrt(k*(k+1))*x). (End)

A160751 a(n) is the smallest n-digit prime formed by appending a digit to a(n-1); a(1)=6.

Original entry on oeis.org

6, 61, 613, 6131
Offset: 1

Views

Author

Juri-Stepan Gerasimov, May 25 2009

Keywords

Comments

There is no prime a(5) since all the integers from 61310 to 61319 are composite.

Crossrefs

Programs

  • Maple
    A160751 := proc(n) option remember ; local d; if n =1 then 6; else for d from 1 to 9 by 2 do if isprime(10*procname(n-1)+d) then RETURN( 10*procname(n-1)+d ) ; fi; od: RETURN(-1) ; fi; end: seq(A160751(n),n=1..10) ; # R. J. Mathar, May 26 2009

Extensions

Corrected by R. J. Mathar, May 26 2009
Showing 1-3 of 3 results.