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.

Showing 1-2 of 2 results.

A066915 a(n) = n^phi(n) + 1.

Original entry on oeis.org

2, 3, 10, 17, 626, 37, 117650, 4097, 531442, 10001, 25937424602, 20737, 23298085122482, 7529537, 2562890626, 4294967297, 48661191875666868482, 34012225, 104127350297911241532842, 25600000001, 7355827511386642, 26559922791425, 907846434775996175406740561330, 110075314177
Offset: 1

Views

Author

Jason Earls, Jan 23 2002

Keywords

Crossrefs

Programs

  • Mathematica
    Table[n^EulerPhi[n]+1,{n,30}] (* Harvey P. Dale, May 29 2014 *)
  • PARI
    a(n) = { n^eulerphi(n) + 1 } \\ Harry J. Smith, Apr 06 2010

Formula

a(n) = A062981(n) + 1.

A067976 Primes of the form 1 + k^phi(k).

Original entry on oeis.org

2, 3, 17, 37, 2708192040014184559945134363758220403329915059847434832829218817
Offset: 1

Views

Author

Labos Elemer, Feb 06 2002

Keywords

Comments

The next term, if it exists, has k > 3000. - Sean A. Irvine, Jan 16 2024

Crossrefs

Programs

  • Mathematica
    Do[s=1+n^(EulerPhi[n]); If[PrimeQ[s], Print[s]], {n, 1, 1000}]
    Select[Table[1+n^EulerPhi[n],{n,100}],PrimeQ] (* Harvey P. Dale, Jul 08 2017 *)

Extensions

Corrected by Hauke Worpel (hw1(AT)email.com), May 29 2003
Showing 1-2 of 2 results.