A192397 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A192397

Record holders for greatest prime factor of n^n + (n+1)^(n+1).

2, 5, 31, 283, 743, 1600069, 60042893, 7438489991, 61215157711, 34041259347101651, 6564253087266573169, 22022174223585405703, 69454092876521107983605569601, 2360926164108571968813424783598971267, 462605180698333957063188362720170172617217, 14645575916792712592989131451003587034531413111, 214236369415820799335832514547376967536187180963

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..17.

Walter Nissen, More terms with additional commentary

FORMULA

A056790(m) < A056790(n), for all m < n

EXAMPLE

60042893 = A056790(9) is in the sequence because all earlier members of A056790 are smaller than 60042893.

PROG

(PARI) fmax=0; for(k=0, 35, my(x=factor(k^k+(k+1)^(k+1)), f=x[#x[, 1], 1]); if(f>fmax, print1(f, ", "); fmax=f)) \\ Hugo Pfoertner, Aug 18 2019