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.

A068956 Number of distinct prime factors of n^n - (n-1)^(n-1).

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 3, 6, 3, 1, 3, 2, 3, 3, 2, 1, 2, 3, 3, 2, 2, 3, 3, 4, 7, 4, 2, 2, 5, 4, 5, 3, 6, 4, 4, 2, 4, 7, 6, 4, 3, 4, 7, 6, 2, 7, 4, 7, 10, 6, 4, 5, 5, 7, 7, 5, 5, 6, 2, 5, 8, 4, 6, 5, 5, 3, 5, 4, 4, 2, 3, 4, 8, 4, 6, 4, 5, 7, 5, 13, 8, 4, 2, 5, 6
Offset: 2

Views

Author

Reinhard Zumkeller, Mar 11 2002

Keywords

Examples

			A007781(13) = 10809131718965763 = 3 * 61^2 * 968299894201, therefore a(14) = 3.
		

Crossrefs

Programs

  • Mathematica
    Table[ Length[ FactorInteger[n^n - (n - 1)^(n - 1)]], {n, 2, 52}] (* Reinhard Zumkeller *)
    PrimeNu[#]&/@(#[[2]]-#[[1]]&/@Partition[Table[n^n,{n,52}],2,1]) (* Harvey P. Dale, Aug 24 2014 *)

Formula

a(n) = A001221(A007781(n-1)).

Extensions

Edited and extended by Robert G. Wilson v, Mar 15 2002
a(53)-a(54) from Alois P. Heinz, May 12 2017
a(55)-a(86) from Amiram Eldar, Feb 06 2020