login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237881 a(n) = 2-adic valuation of prime(n)+prime(n+1). 1
0, 3, 2, 1, 3, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 4, 3, 7, 1, 4, 3, 1, 2, 1, 1, 2, 1, 3, 1, 4, 1, 2, 2, 5, 2, 2, 6, 1, 2, 5, 3, 2, 7, 1, 2, 1, 1, 1, 3, 1, 3, 5, 2, 2, 3, 2, 2, 2, 1, 2, 6, 3, 1, 4, 1, 3, 2, 2, 3, 1, 3, 1, 2, 4, 1, 2, 1, 1, 1, 2, 3, 2, 5, 3, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 3, 6, 4, 5, 2, 2, 2, 2, 2, 3, 4, 3, 2, 1, 2, 1, 3, 2, 1, 2, 5, 3, 1, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A007814(A001043(n)).

a(n) << log n; in particular, a(n) <= log_2 n + log_2 log n + O(1). - Charles R Greathouse IV, Feb 14 2014

EXAMPLE

a(5)=3 because prime(5)=11, Prime(6)=13, 11+13=24=2^3*3, 2-adic valuation(24)=3.

PROG

(PARI) {for(i=1, 200, k=valuation(prime(i)+prime(i+1), 2); print1(k, ", "))}

CROSSREFS

Cf. A071087, A098048.

Sequence in context: A085068 A265027 A079587 * A112745 A205564 A036585

Adjacent sequences:  A237878 A237879 A237880 * A237882 A237883 A237884

KEYWORD

nonn,easy

AUTHOR

Antonio Roldán, Feb 14 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified January 21 13:38 EST 2018. Contains 297994 sequences.