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.

A377671 Number of prime factors of n^n+n (counted with multiplicity).

This page as a plain text file.
%I A377671 #17 Nov 04 2024 01:36:07
%S A377671 1,2,3,4,3,5,6,7,4,7,4,5,4,8,6,8,5,7,11,7,6,10,6,8,7,10,10,12,6,7,11,
%T A377671 11,7,13,7,11,8,7,5,12,7,7,13,9,10,18,6,11,11,11,11,12,10,11,14,14,12,
%U A377671 11,7,10,13,7,8,21,5,14,10,8,7,15,11,10,13,8,9,17
%N A377671 Number of prime factors of n^n+n (counted with multiplicity).
%H A377671 Amiram Eldar, <a href="/A377671/b377671.txt">Table of n, a(n) for n = 1..116</a>
%F A377671 a(n) = A001222(A066068(n)).
%p A377671 seq(numtheory:-bigomega(n^n+n),n=1..76); # _Robert Israel_, Nov 03 2024
%t A377671 a[n_] := PrimeOmega[n^n + n]; Array[a, 45] (* _Amiram Eldar_, Nov 04 2024 *)
%o A377671 (PARI) a(n) = bigomega(n^n+n);
%Y A377671 Cf. A001222, A066068, A085723, A372228, A372546, A377672, A377673, A377674.
%K A377671 nonn
%O A377671 1,2
%A A377671 _Sean A. Irvine_, Nov 03 2024