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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098117 a(n) = 5^(prime(n) - 1) + 5^prime(n) - 1. 0

%I #17 Sep 08 2022 08:45:14

%S 29,149,3749,93749,58593749,1464843749,915527343749,22888183593749,

%T 14305114746093749,223517417907714843749,5587935447692871093749,

%U 87311491370201110839843749,54569682106375694274902343749,1364242052659392356872558593749

%N a(n) = 5^(prime(n) - 1) + 5^prime(n) - 1.

%F a(n) = A198764(prime(n)-1) = A198764(A000040(n)-1). - _Michel Marcus_, Aug 27 2015

%e a(1) = 5^(2 - 1) + (5^2 - 1) = 29.

%t Table[5^(Prime[n] - 1) + (5^Prime[n] - 1), {n, 1, 15}] (* _Stefan Steinerberger_, Feb 28 2006 *)

%o (PARI) main(m)=forprime(p=2,100, print1(", ",5^(p-1) + (5^p - 1))) \\ _Anders Hellström_, Aug 26 2015

%o (Magma) [5^(NthPrime(n)-1) + 5^NthPrime(n) - 1: n in [1..20]]; // _Vincenzo Librandi_, Aug 27 2015

%Y Cf. A097743.

%K nonn

%O 1,1

%A _Parthasarathy Nambi_, Sep 23 2004

%E More terms from _Stefan Steinerberger_, Feb 28 2006

%E a(14) from _Vincenzo Librandi_, Aug 27 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)