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.

A119318 n-th divisor of A119311(n), the smallest number such that the n-th divisor is a prime power.

This page as a plain text file.
%I A119318 #5 Mar 13 2015 00:19:39
%S A119318 1,2,4,8,16,8,27,16,27,32,27,64,27,128,32,256,81,128,64,1024,256,128,
%T A119318 128,512,243,256,256,128,128,512,512,128,256,128,256,243,343,729,729,
%U A119318 512,512,256,4096,729,1024,729,1024,512,256,512,729,2048,256,1024,1024
%N A119318 n-th divisor of A119311(n), the smallest number such that the n-th divisor is a prime power.
%C A119318 Not all terms are powers of 2 or of 3, see example.
%e A119318 n=37: the set of divisors of A119311(37) = 41160 has
%e A119318 tau(41160) = 64 elements: {1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 20, 21, 24, 28, 30, 35, 40, 42, 49, 56, 60, 70, 84, 98, 105, 120, 140, 147, 168, 196, 210, 245, 280, 294, [[343]], 392, 420, 490, 588, 686, ...}; the 37th divisor of 41160 = a(37) = 343 = 7^3.
%Y A119318 Cf. A119317, A119319.
%K A119318 nonn
%O A119318 1,2
%A A119318 _Reinhard Zumkeller_, May 15 2006