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!)
A337219 a(n) is the least positive number k such that 3^n+k has n prime factors counted with multiplicity. 1
2, 1, 1, 3, 9, 7, 21, 63, 157, 471, 5, 15, 45, 135, 405, 1215, 3645, 10935, 32805, 98415, 295245, 885735, 2657205, 4409119, 2741597, 8224791, 16285765, 15302863, 45908589, 137725767, 77632981, 232898943, 161825917, 485477751, 1456433253, 3027122479, 1565174669 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
a[n_] := Module[{k = 1}, While[PrimeOmega[3^n + k] != n, k++]; k]; Array[a, 20] (* Amiram Eldar, Sep 18 2020 *)
PROG
(PARI) a(n) = for(k=1, oo, if(bigomega(3^n+k)==n, return(k))); \\ Daniel Suteu, Oct 17 2020
CROSSREFS
Cf. A078843.
Sequence in context: A235453 A219206 A077385 * A220898 A336163 A066013
KEYWORD
nonn
AUTHOR
Zak Seidov, Sep 14 2020
EXTENSIONS
a(27)-a(37) from Daniel Suteu, Sep 14 2020
Definition edited by Zak Seidov, Oct 17 2020
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 19 16:21 EDT 2024. Contains 371794 sequences. (Running on oeis4.)