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.

A154882 a(n) is the smallest number with at least as many divisors as a(n-1)^2.

This page as a plain text file.
%I A154882 #9 Mar 17 2022 02:48:44
%S A154882 2,4,12,120,7560,8648640,1927522396800,4747472432036420486400,
%T A154882 128438082648984172330026178330296384000,
%U A154882 6184173455628205993842062057864303743050691444602955105860128640000
%N A154882 a(n) is the smallest number with at least as many divisors as a(n-1)^2.
%F A154882 a(n) = A061799(A048691(a(n-1))). - _R. J. Mathar_, Jan 21 2009
%e A154882 4^2 = 16 has 5 divisors; the smallest number with at least 5 divisors is 12.
%K A154882 nonn
%O A154882 1,1
%A A154882 _J. Lowell_, Jan 16 2009
%E A154882 a(6)-a(10) from _Donovan Johnson_, May 09 2009