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!)
A023591 Greatest exponent in prime-power factorization of 2*prime(n)+1. 2

%I #8 Apr 20 2021 22:42:34

%S 1,1,1,1,1,3,1,1,1,1,2,2,1,1,1,1,1,1,3,1,2,1,1,1,1,1,2,1,1,1,1,1,2,2,

%T 1,1,2,1,1,1,1,2,1,2,1,1,2,1,1,3,1,1,1,1,1,1,2,1,1,1,4,1,1,1,1,1,1,3,

%U 1,1,1,1,2,2,1,1,1,1,1,2,1,1,1,2,1,1,1,1,1,2,1,1,2,1,3,1,1,1,1

%N Greatest exponent in prime-power factorization of 2*prime(n)+1.

%p A023591 := proc(n)

%p A051903(2*ithprime(n)+1) ;

%p end proc: # _R. J. Mathar_, Jul 08 2015

%o (PARI) a(n) = vecmax(factor(2*prime(n)+1)[,2]); \\ _Michel Marcus_, Apr 20 2021

%Y Cf. A051903, A072055.

%K nonn

%O 1,6

%A _Clark Kimberling_

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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)