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.

A062481 a(n) = n^prime(n).

This page as a plain text file.
%I A062481 #37 Jun 16 2022 10:26:11
%S A062481 1,8,243,16384,48828125,13060694016,232630513987207,
%T A062481 144115188075855872,8862938119652501095929,
%U A062481 100000000000000000000000000000,191943424957750480504146841291811,8505622499821102144576131684114829934592,4695452425098908797088971409337422035076128813
%N A062481 a(n) = n^prime(n).
%H A062481 Harry J. Smith, <a href="/A062481/b062481.txt">Table of n, a(n) for n = 1..50</a>
%F A062481 From _Amiram Eldar_, Nov 18 2020: (Start)
%F A062481 a(n) = n^A000040(n).
%F A062481 Sum_{n>=1} 1/a(n) = A096250. (End)
%F A062481 a(n) == n (mod prime(n)). [Fermat's little theorem] - _Nicolas Bělohoubek_, Jun 14 2022
%t A062481 Table[n^Prime[n],{n,20}] (* _Harvey P. Dale_, Jun 12 2014 *)
%o A062481 (PARI) a(n)={n^prime(n)} \\ _Harry J. Smith_, Aug 08 2009
%o A062481 (Python)
%o A062481 from sympy import prime
%o A062481 def a(n): return n**prime(n)
%o A062481 print([a(n) for n in range(1, 14)]) # _Michael S. Branicky_, Jun 15 2022
%Y A062481 Cf. A000040, A000312, A051674, A096250.
%K A062481 easy,nonn
%O A062481 1,2
%A A062481 _Labos Elemer_, Jul 09 2001
%E A062481 More terms from _Harvey P. Dale_, Jun 12 2014