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.

A001041 a(0)=12; thereafter a(n) = 12 times the product of the first n primes.

This page as a plain text file.
%I A001041 #39 Jul 08 2025 00:18:14
%S A001041 12,24,72,360,2520,27720,360360,6126120,116396280,2677114440,
%T A001041 77636318760,2406725881560,89048857617720,3651003162326520,
%U A001041 156993135980040360,7378677391061896920,391069901726280536760,23073124201850551668840
%N A001041 a(0)=12; thereafter a(n) = 12 times the product of the first n primes.
%C A001041 Bob Marshall calls these the "holotomic numbers" and opines: "This sequence, aptly designated as the Holotomic Sequence, represents the minimal plural quantities that accommodate the maximum amount of consecutive factors." Thus this can be seen as a version of A051451. - _Charles R Greathouse IV_, Jan 12 2012
%C A001041 If we were to take the maximum number of consecutive factors as the definition, the sequence would be prefixed with 1, 2, 6. - _Franklin T. Adams-Watters_, Jun 13 2015
%H A001041 T. D. Noe, <a href="/A001041/b001041.txt">Table of n, a(n) for n = 0..100</a>
%H A001041 R. K. Guy, <a href="/A002186/a002186.pdf">Letters to N. J. A. Sloane, June-August 1968</a>
%H A001041 <a href="/index/Di#divseq">Index to divisibility sequences</a>
%t A001041 12*FoldList[ #1*Prime[ #2 ]&, 1, Range[ 20 ] ]
%o A001041 (PARI) a(n)=12*prod(i=1,n,prime(i)); \\ _Charles R Greathouse IV_, Jan 12 2012
%o A001041 (Magma) [12] cat [12*&*[NthPrime(i):i in [1..n]]:n in [1..17]]; // _Marius A. Burtea_, Feb 11 2020
%Y A001041 Equals 12 * A002110.
%K A001041 nonn,easy
%O A001041 0,1
%A A001041 Bob Marshall, 1811 California St., Eureka CA 95501
%E A001041 More terms from _James Sellers_, Sep 19 2000