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.

A061234 Smallest number with prime(n)^2 divisors where prime(n) is the n-th prime.

This page as a plain text file.
%I A061234 #17 Jun 21 2024 06:38:24
%S A061234 6,36,1296,46656,60466176,2176782336,2821109907456,101559956668416,
%T A061234 131621703842267136,6140942214464815497216,221073919720733357899776,
%U A061234 10314424798490535546171949056,13367494538843734067838845976576
%N A061234 Smallest number with prime(n)^2 divisors where prime(n) is the n-th prime.
%H A061234 Amiram Eldar, <a href="/A061234/b061234.txt">Table of n, a(n) for n = 1..208</a>
%F A061234 a(n) = Min_{x : d(x) = A000005(x) = p(n)^2} = 6^(p(n)-1) because x = 2^(pp-1) > 2^(p-1)3^(p-1) holds if p > 1.
%F A061234 a(n) = A005179(A001248(n)). - _Amiram Eldar_, Jun 21 2024
%e A061234 1296 = 2*2*2*2*3*3*3*3 is the smallest number with 25 divisors.
%Y A061234 Cf. A000005, A000040, A001248, A003680, A005179, A037992, A061148, A061149, A061283, A061286.
%K A061234 nonn
%O A061234 1,1
%A A061234 _Labos Elemer_, Jun 01 2001