The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
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 (list; graph; refs; listen; history; text; internal format)
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: A050345 A348611 A070039 * A319137 A074122 A335182
KEYWORD
nonn
AUTHOR
Bruno Berselli, Aug 05 2013
STATUS
approved

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 May 17 10:20 EDT 2024. Contains 372594 sequences. (Running on oeis4.)