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!)
A249784 Number of divisors of n^(n^n). 2
1, 5, 28, 513, 3126, 2176875649, 823544, 50331649, 774840979, 100000000020000000001, 285311670612, 158993694406808436568227841, 302875106592254, 123476695691247958050243432972289, 191751059232884087544279144287109376, 73786976294838206465 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
An infinite number of squares are terms of this sequence.
Proof: for any n of the form (p*q)^k (with p and q distinct primes), a(n) = (k * n^n + 1)^2.
It seems likely that the only nontrivial palindromes in this sequence comprise a subset of these squares and occur at n = 10^(10^M) for M>=0; at such values of n, a(n) = (10^(10^(10^M + M) + M) + 1)^2 = A033934(10^(10^M + M) + M). The actual decimal expansion of each of these numbers is of the form 1000...0002000...0001, where the total number of zero digits on each side of the 2 is 10^(10^M + M) + M - 1.
LINKS
FORMULA
a(n) = A000005(A002488(n)).
a(n) = Product_{j=1..m} (e_j * n^n + 1)
where m = number of distinct prime factors of n
and e_j = multiplicity of the j-th prime factor.
If n is a prime p, then m=1 and e_1=1, so
a(p) = p^p + 1 = A000312(p) + 1 = A014566(p).
If n=10^L, then m=2 and e_1=e_2=L, so
a(10^L) = (L * 10^(L * 10^L) + 1)^2.
EXAMPLE
12 = 2^2 * 3^1 (two distinct prime factors, with multiplicities e_1=2 and e_2=1), so a(12) = (2*k+1)*(1*k+1) = 2*k^2 + 3*k + 1 where k = 12^12, so a(12) = 158993694406808436568227841.
PROG
(Magma) // program to generate b-file
for n in [1..155] do
k:=n^n;
F:=Factorization(n);
prod:=1;
for j in [1..#F] do
prod*:=F[j, 2]*k + 1;
end for;
n, prod;
end for;
(Sage)
def A249784(n):
n_exp_n = n^n
return mul(exp[1]*n_exp_n + 1 for exp in factor(n))
[A249784(n) for n in (1..16)] # Peter Luschny, Nov 08 2014
(PARI) a(n)=my(v=factor(n)[, 2]*n^n); prod(i=1, #v, v[i]+1) \\ Charles R Greathouse IV, Jul 21 2015
CROSSREFS
Sequence in context: A345632 A024068 A308593 * A359649 A346312 A359739
KEYWORD
nonn
AUTHOR
Jon E. Schoenfield, Nov 05 2014
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 20 00:26 EDT 2024. Contains 371798 sequences. (Running on oeis4.)