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!)
A193330 Number of prime factors of n^2 + 1, counted with multiplicity. 9
0, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 2, 3, 1, 2, 1, 3, 3, 2, 1, 3, 2, 3, 1, 2, 1, 3, 2, 2, 2, 3, 3, 3, 2, 2, 1, 3, 3, 2, 1, 3, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 3, 1, 3, 1, 5, 2, 2, 2, 2, 2, 3, 2, 2, 1, 3, 4, 2, 3, 2, 3, 4, 1, 3, 2, 3, 2, 2, 2, 3, 3, 4, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
a(n) is also the number of terms, counted with multiplicity, in a prime factorization of n + i in the ring of Gaussian integers. - Jason Kimberley, Dec 17 2011
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 0..10000
MATHEMATICA
A193330[n_Integer] := PrimeOmega[n^2 + 1]; A193330 /@ Range[0, 100]
PrimeOmega/@(Range[0, 90]^2+1) (* Harvey P. Dale, Apr 03 2019 *)
PROG
(PARI) a(n)=bigomega(n^2+1) \\ Charles R Greathouse IV, Jul 23, 2011
CROSSREFS
Sequence in context: A204893 A251717 A057217 * A147810 A305302 A340382
KEYWORD
nonn
AUTHOR
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 11:24 EDT 2024. Contains 371967 sequences. (Running on oeis4.)