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.

A072371 a(0) = 0, a(1) = 1, a(n+1) = 2*a(n) + (2*n-1)^2*a(n-1).

Original entry on oeis.org

1, 2, 5, 28, 181, 1734, 18129, 246072, 3555945, 62478090, 1152624285, 24859839060, 558026987805, 14266908838350, 377300685054825, 11155177913266800, 339620231957641425, 11399366438564677650, 392645165479000867125, 14749514218199731855500, 567030259977151650805125
Offset: 0

Views

Author

N. J. A. Sloane, Jul 19 2002

Keywords

References

  • A. E. Jolliffe, Continued Fractions, in Encyclopaedia Britannica, 11th ed., pp. 30-33; see p. 31.

Crossrefs

Programs

  • Maple
    f := proc(n) option remember; local a,b,t1,t2,t3,i,j,k; a := 1; b := 2; if n=0 then RETURN(a) elif n=1 then RETURN(b) else RETURN(2*f(n-1)+ (2*n-3)^2*f(n-2)); fi; end;