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.

A191624 Largest prime factor of n^n - n^(n-1) - n^(n-2) - ... - n^2 - n - 1.

Original entry on oeis.org

7, 19, 293, 1493, 179, 1091, 10593529, 379721, 165664841, 66987982331, 240717199, 28048051, 133933781, 25506609089573701, 107140256350247, 793435901761, 268232479553269300213, 4075297, 3063504618316968426599, 1372263056872621, 7514001866134191512025247
Offset: 3

Views

Author

Juri-Stepan Gerasimov, Jun 12 2011

Keywords

Crossrefs

Programs

  • Maple
    A006530 := proc(n) max ( numtheory[factorset](n) ) ;end proc:
    A191690 := proc(n) n^n-add( n^j,j=0..n-1) ;end proc:
    A191624 := proc(n) A006530(A191690(n)) ; end proc:
    seq(A191624(n),n=3..15) ; # R. J. Mathar, Jun 23 2011
  • Mathematica
    Table[With[{s=n^Range[0,n]},FactorInteger[Last[s]-Total[Most[s]]][[-1,1]]],{n,3,20}] (* Harvey P. Dale, Feb 02 2015 *)
  • PARI
    a(n) = if(n==0, return(1)); vecmax(factor(n^n - (n^n-1)/(n-1))[,1]); \\ Daniel Suteu, Jun 09 2022

Formula

a(n) = A006530(A191690(n)).

Extensions

More terms from Harvey P. Dale, Feb 02 2015