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!)
A255542 a(n) = number of prime factors of (3^n + 10). 1
1, 1, 1, 1, 2, 2, 1, 3, 1, 2, 4, 3, 2, 3, 2, 3, 5, 3, 1, 3, 3, 3, 4, 2, 3, 4, 2, 6, 4, 3, 3, 4, 3, 2, 5, 4, 1, 4, 5, 5, 5, 2, 4, 3, 3, 5, 5, 2, 2, 5, 4, 3, 4, 3, 3, 6, 4, 4, 5, 5, 7, 3, 3, 4, 5, 5, 2, 6, 3, 5, 5, 4, 4, 5, 3, 7, 6, 4, 4, 3, 2, 4, 5, 4, 2, 4, 3, 2, 4, 4, 4, 5, 4, 6, 7, 4, 3, 5, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
FORMULA
a(n) = A001222(3^n+10).
EXAMPLE
a(0)=1 because 3^0+10=11, prime;
a(4)=2 because 3^4+10=91=7*13, semiprime;
a(7)=3 because 3^7+10=2197=13*13*13, 3-almost prime;
a(10)=4 because 3^7+10=59059=7*11*13*59, 4-almost prime;
a(16)=5 because 3^16+10=43046731=7*13*23*131*157, 5-almost prime.
MATHEMATICA
a[n_]:= PrimeOmega[3^n+10]
PROG
(PARI) a(n) = bigomega(3^n+10)
CROSSREFS
Sequence in context: A166363 A117470 A070786 * A117500 A297626 A206441
KEYWORD
nonn
AUTHOR
Zak Seidov, Feb 25 2015
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 April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)