cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A217435 Number of prime factors of n^n+(n-1)^(n-1), counted with multiplicity.

This page as a plain text file.
%I A217435 #26 Oct 02 2021 16:56:32
%S A217435 1,1,1,1,4,2,3,2,3,2,5,2,6,4,2,3,6,3,3,4,6,2,7,3,5,5,3,3,5,3,3,3,7,4,
%T A217435 5,4,3,2,2,2,6,3,6,4,5,3,8,6,6,3,5,5,5,5,3,3,5,2,8,4,4,6,6,6,8,8,4,3,
%U A217435 4,7,7,6,6,4,4,7,9,6,7,5,9,5,7,4,3,5,6,7,9,3,2,5
%N A217435 Number of prime factors of n^n+(n-1)^(n-1), counted with multiplicity.
%H A217435 M. F. Hasler and Amiram Eldar, <a href="/A217435/b217435.txt">Table of n, a(n) for n = 1..143</a> (terms 1..112 from M. F. Hasler)
%H A217435 W. Nissen, <a href="http://upforthecount.com/math/nnpomega.html">np ( n ) = n^n + (n+1)^(n+1) — 2 prominent questions</a>, Oct 02 2012.
%H A217435 W. Nissen, <a href="http://upforthecount.com/math/nnp5.html">Prime factors of np ( n ) = n^n + (n+1)^(n+1)</a>, Up for the Count.
%F A217435 a(n) = A001222(A056788(n)).
%p A217435 A217435:=n->numtheory[bigomega](n^n+(n-1)^(n-1)): seq(A217435(n), n=1..30); # _Wesley Ivan Hurt_, Jan 27 2017
%t A217435 Join[{1}, Table[PrimeOmega[n^n + (n-1)^(n-1)], {n, 2, 30}]] (* _Amiram Eldar_, Feb 24 2020 *)
%t A217435 Join[{1},PrimeOmega[Total/@Partition[#^#&/@Range[30],2,1]]] (* _Harvey P. Dale_, Oct 02 2021 *)
%o A217435 (PARI) for(n=1,999,print1(bigomega((n-1)^(n-1)+n^n)","))
%K A217435 nonn,hard
%O A217435 1,5
%A A217435 _M. F. Hasler_, Oct 02 2012
%E A217435 Data beyond a(49) from W. Nissen's web site.