A257567 a(n) is the largest exponent k such that 3^k divides (prime(n)^2 + 2).

1, 0, 3, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 3, 1, 2, 1, 2, 2, 1, 3, 1, 3, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 3, 1, 4, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 2

Offset

1,3

Comments

Except for n=2, all a(n) > 1 because (prime(n)^2 + 2) is divisible by 3.

Links

Zak Seidov, Table of n, a(n) for n = 1..1000

Formula

a(n) = A007949(A061725(n)). - Michel Marcus, May 01 2015

Example

a(1) = 1 because p=prime(1)=2 and p^2 + 2 =  6 = 3^1*2,
a(2) = 0 because p=prime(2)=3 and p^2 + 2 = 11 = 3^0*11,
a(3) = 3 because p=prime(3)=5 and p^2 + 2 = 27 = 3^3.

Mathematica

Table[IntegerExponent[Prime[k]^2 + 2, 3], {k, 100}]

Prog

(PARI) a(n) = valuation(prime(n)^2+2, 3); \\ Michel Marcus, May 01 2015

Crossrefs

Cf. A007949 (3-adic valuation), A061725 (p^2+2, with p prime), A257568.

Sequence in context: A174820 A099501 A089762 * A318440 A307790 A189965

Adjacent sequences: A257564 A257565 A257566 * A257568 A257569 A257570

Keyword

nonn

Author

Zak Seidov, Apr 30 2015

Status

approved