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.

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

Original entry on oeis.org

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

Views

Author

Walter Nissen, Jun 29 2011

Keywords

Examples

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

Crossrefs

Programs

  • 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

Formula

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

Extensions

2 added by Arkadiusz Wesolowski, Jun 30 2011