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.

A193759 Array, by antidiagonals, A(k,n) is the number of prime factors of n^(2^k) + 1, counted with multiplicity.

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 2, 1, 0, 1, 1, 3, 1, 2, 0, 1, 2, 2, 1, 2, 1, 0, 1, 2, 2, 2, 3, 1, 3, 0, 1, 2, 2, 2, 3, 2, 2, 2, 0, 1, 2, 6, 2, 4, 3, 3, 2, 2, 0, 1, 3, 5, 2, 4, 3, 3, 3, 3, 1, 3, 0, 1, 4, 7, 3, 4, 3, 4, 3, 2, 2, 2, 1, 0, 1, 5
Offset: 0

Views

Author

Jonathan Vos Post, Aug 11 2011

Keywords

Comments

The main diagonal A(n,n) = number of prime factors of n^(2^n) + 1, counted with multiplicity, begins 0, 1, 1, 3, 2, 4, 3, 6, 6.

Examples

			A(4,5) = 3 because 1+5^16 = 152587890626 = 2 * 2593 * 29423041, which has 3 prime factors. The array begins:
================================================================
....|n=0|n=1|n=2|n=3|n=4|n=5|n=6|n=7|n=8|n=9|.10|.11|comment
====|===|===|===|===|===|===|===|===|===|===|===|===|===========
k=0.|.0.|.1.|.1.|.2.|.1.|.2.|.1.|.3.|.2.|.2.|.1.|.3.|A001222
k=1.|.0.|.1.|.1.|.2.|.1.|.2.|.1.|.3.|.2.|.2.|.1.|.2.|A193330
k=2.|.0.|.1.|.1.|.2.|.1.|.2.|.1.|.2.|.2.|.3.|.2.|.2.|A193929
k=3.|.0.|.1.|.1.|.3.|.1.|.3.|.2.|.3.|.3.|.2.|.2.|.3.|A194003
k=4.|.0.|.1.|.1.|.2.|.2.|.3.|.3.|.3.|.3.|.2.|.5.|.3.|not in OEIS
k=5.|.0.|.1.|.2.|.2.|.2.|.4.|.3.|.4.|.3.|.2.|.4.|.4.|not in OEIS
================================================================
		

Crossrefs

Extensions

Edited by Alois P. Heinz, Aug 11 2011
More terms from Max Alekseyev, Sep 09 2011