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.

A078726 Fermat numbers 2^(2^n) + 1 with digits sorted in increasing order and zeros suppressed.

Original entry on oeis.org

3, 5, 17, 257, 35567, 2244677999, 111344445566777789, 111222233333334444445666666777788899, 111111222223333333344444455555555566666666777777778888888999999999999
Offset: 0

Views

Author

Jason Earls, Dec 20 2002

Keywords

Comments

The 0, 1, 2, 3, 5 and 7 terms of this sequence are primes. Are there any more?

Crossrefs

Cf. A000215.

Programs

  • Mathematica
    Table[FromDigits[Sort[IntegerDigits[2^2^n+1]]/.(0->Nothing)],{n,0,10}] (* Harvey P. Dale, Apr 11 2021 *)