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.

A063487 Number of distinct prime divisors of 2^(2^n)-1 (A051179).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 7, 9, 11, 13, 16, 20, 25
Offset: 0

Views

Author

Jason Earls, Jul 28 2001

Keywords

Comments

2^(2^n)-1 is the product of the first n Fermat numbers F(0),...,F(n-1) (A000215). Hence this sequence is just the summation of A046052, which gives the number of prime factors in each Fermat number. - T. D. Noe, Jan 07 2003

References

  • D. M. Burton, Elementary Number Theory, Allyn and Bacon Inc., Boston MA, 1976, p. 238.

Crossrefs

Programs

  • PARI
    for(n=0,22,print(omega(2^(2^n)-1)))

Extensions

More terms from T. D. Noe, Jan 07 2003