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!)
A023588 a(n) = sum of exponents in prime-power factorization of 2*prime(n)-1. 0

%I #11 Dec 29 2014 03:12:43

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

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

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

%N a(n) = sum of exponents in prime-power factorization of 2*prime(n)-1.

%F a(n) = A001222(A076274(n)). - _R. J. Mathar_, Mar 10 2011

%t Array[Plus@@Last/@FactorInteger[2*Prime[ # ]-1]&,6! ] (* _Vladimir Joseph Stephan Orlovsky_, Feb 28 2010 *)

%K nonn

%O 1,3

%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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)