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.

A027475 a(n) = (n-1) * 15^(n-2).

Original entry on oeis.org

1, 30, 675, 13500, 253125, 4556250, 79734375, 1366875000, 23066015625, 384433593750, 6343154296875, 103797070312500, 1686702392578125, 27246730957031250, 437893890380859375, 7006302246093750000
Offset: 2

Views

Author

Keywords

Comments

Second column of A027467.

Crossrefs

Cf. A027467.

Programs

Formula

Numerators of sequence a[2,n] in (a[i,j])^4 where a[i,j] = binomial(i-1, j-1)/2^(i-1) if j<=i, 0 if j>i.
G.f.: x^2/(1 - 15*x)^2. - Vincenzo Librandi, Jul 16 2018
a(2) = 1, a(3) = 30; for n >= 4, a(n) = 30*a(n-1) - 225*a(n-2). - Jianing Song, Jul 16 2018

Extensions

More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 17 2005