|
%I #29 Apr 03 2019 18:32:31
%S 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,
%T 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,
%U 4,2,3,2,3,4,1,3,2,3,2,2,2,3,3,4,1,2
%N Number of prime factors of n^2 + 1, counted with multiplicity.
%C 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
%H Charles R Greathouse IV, <a href="/A193330/b193330.txt">Table of n, a(n) for n = 0..10000</a>
%t A193330[n_Integer] := PrimeOmega[n^2 + 1];A193330 /@ Range[0, 100]
%t PrimeOmega/@(Range[0,90]^2+1) (* _Harvey P. Dale_, Apr 03 2019 *)
%o (PARI) a(n)=bigomega(n^2+1) \\ _Charles R Greathouse IV_, Jul 23, 2011
%Y Cf. A046051, A054992, A193295.
%K nonn
%O 0,4
%A _Vladimir Joseph Stephan Orlovsky_, Jul 22 2011
|
