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

A152588 15^(2^n) + 2.

Original entry on oeis.org

17, 227, 50627, 2562890627, 6568408355712890627, 43143988327398919500410556793212890627, 1861403728794734215467410604755702820123364205073812627233564853668212890627
Offset: 0

Views

Author

Cino Hilliard, Dec 08 2008

Keywords

Programs

  • PARI
    g(a,n) = if(a%2,b=2,b=1);for(x=0,n,y=a^(2^x)+b;print1(y","))

Formula

a(n) = A175138(n+3)+2. - R. J. Mathar, Sep 10 2016

A174230 a(n) = product_{i=1..n-1} a(i), with a(1) = 3 and a(2) = 7.

Original entry on oeis.org

3, 7, 21, 441, 194481, 37822859361, 1430568690241985328321, 2046526777500669368329342638102622164679041, 4188271851027274266670020743752976432915773724299403513508038881183728210190544679681
Offset: 1

Views

Author

Giovanni Teofilatto, Mar 15 2010

Keywords

Comments

Except for first two terms a(n) = 21^2^n
Except for first three terms, a(n) = (a(n-1))^2 .

Crossrefs

Cf. A175138.

Programs

  • Mathematica
    Join[{3,7},NestList[#^2&,21,7]] (* Harvey P. Dale, Jan 18 2012 *)
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.