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

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

Original entry on oeis.org

1, 2, 10, 310, 384710, 740009305210, 3285682630785061608169810, 75569972451698504356522006689642008796426176222510, 45686565890803766858880247710072390769807010129716258796255559717444312778982342222557219570421823310
Offset: 0

Views

Author

Daniel Suteu, Dec 24 2016

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := a[n - 1] (n*a[n - 1] + 1); a[0] = 1; Array[a, 9, 0] (* Robert G. Wilson v, Dec 24 2016 *)
  • PARI
    a(n) = if(n==0, 1, n * a(n-1)^2 + a(n-1));

Formula

a(n) ~ c^(2^n) / n, where c = 2.49513423157979814033214501746049499374370018515926861932281537537499551261588753466... - Vaclav Kotesovec, Jan 28 2019
a(n) = A295391(n)*a(n-1), n >= 1. - N. J. A. Sloane, Sep 03 2024
Showing 1-1 of 1 results.