login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A227991
Highest power of 3 dividing prime(n)+1.
2
3, 1, 3, 1, 3, 1, 9, 1, 3, 3, 1, 1, 3, 1, 3, 27, 3, 1, 1, 9, 1, 1, 3, 9, 1, 3, 1, 27, 1, 3, 1, 3, 3, 1, 3, 1, 1, 1, 3, 3, 9, 1, 3, 1, 9, 1, 1, 1, 3, 1, 9, 3, 1, 9, 3, 3, 27, 1, 1, 3, 1, 3, 1, 3, 1, 3, 1, 1, 3, 1, 3, 9, 1, 1, 1, 3, 3, 1, 3, 1, 3, 1, 27, 1, 1, 3, 9
OFFSET
1,1
LINKS
FORMULA
a(n) = 3^A227990(n).
MATHEMATICA
Table[3^IntegerExponent[Prime[n] + 1, 3], {n, 100}]
PROG
(PARI) forprime(p=2, 700, print1(3^valuation(p+1, 3), ", "));
(Magma) [3^Valuation(NthPrime(n)+1, 3): n in [1..100]];
CROSSREFS
Cf. A068503 (highest power of 3 dividing prime(n)-1), A068504 (highest power of 2 dividing prime(n)+1), A227990.
Sequence in context: A348611 A070039 A373032 * A319137 A074122 A372834
KEYWORD
nonn
AUTHOR
Bruno Berselli, Aug 05 2013
STATUS
approved