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.

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

This page as a plain text file.
%I A066915 #18 Dec 09 2024 10:42:16
%S A066915 2,3,10,17,626,37,117650,4097,531442,10001,25937424602,20737,
%T A066915 23298085122482,7529537,2562890626,4294967297,48661191875666868482,
%U A066915 34012225,104127350297911241532842,25600000001,7355827511386642,26559922791425,907846434775996175406740561330,110075314177
%N A066915 a(n) = n^phi(n) + 1.
%H A066915 Harry J. Smith, <a href="/A066915/b066915.txt">Table of n, a(n) for n = 1..100</a>
%F A066915 a(n) = A062981(n) + 1.
%t A066915 Table[n^EulerPhi[n]+1,{n,30}] (* _Harvey P. Dale_, May 29 2014 *)
%o A066915 (PARI) a(n) = { n^eulerphi(n) + 1 } \\ _Harry J. Smith_, Apr 06 2010
%Y A066915 Cf. A000010, A062981, A066719, A066916.
%K A066915 nonn
%O A066915 1,1
%A A066915 _Jason Earls_, Jan 23 2002