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.

A187112 a(n) = cube root of the largest proper divisor of A187104(n).

This page as a plain text file.
%I A187112 #12 Aug 09 2014 23:00:22
%S A187112 2,3,3,4,5,5,6,5,7,8,7,9,7,10,9,7,11,12,11,13,14,13,11,15,16,11,17,15,
%T A187112 13,18,19,11,17,13,20,21,19,22,13,23,17,24,21,13,25,19,17,26,23,27,28,
%U A187112 25,19,29,30,17,27,31,23,17,32,33,29,19,25,34,17,23,35,19,31,36,37,33,38,19,39,29,40,35,19,23,41,42,31,37,23,43,44,29,39,45,46,41,23,47,31,35,48,23,49,43,50
%N A187112 a(n) = cube root of the largest proper divisor of A187104(n).
%H A187112 Zak Seidov, <a href="/A187112/b187112.txt">Table of n, a(n) for n = 1..2671</a>
%F A187112 a(n) = A048766(A032742(A187104(n))). - _Michel Marcus_, Aug 09 2014
%o A187112 (PARI) lista(nn) = {forcomposite(n=1, nn, if (ispower(divisors(n)[numdiv(n)-1], 3, &k), print1(k, ", ")););} \\ _Michel Marcus_, Aug 09 2014
%Y A187112 Cf. A187104 (largest proper divisor is a cube).
%K A187112 nonn
%O A187112 1,1
%A A187112 _Zak Seidov_, Mar 05 2011