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.

A064772 Sum of primes dividing n^n+1 (with repetition).

Original entry on oeis.org

2, 5, 11, 257, 526, 147, 1030, 1027, 530793, 31603, 58685, 2228292, 113060, 180326, 163123, 67280421584898, 45957792327018709129, 33414185, 870543318650, 4406613081350403, 22864393425065, 82812579069940, 1576297793, 27266016518
Offset: 1

Views

Author

Jason Earls, Oct 19 2001

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Total[Times@@@FactorInteger[n^n+1]],{n,25}] (* Harvey P. Dale, Sep 17 2011 *)
  • PARI
    sopfr(n)= { local(f,s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]*f[i, 2]); return(s) } { for (n=1, 61, write("b064772.txt", n, " ", sopfr(n^n + 1)) ) } \\ Harry J. Smith, Sep 24 2009