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.

A261341 Numbers n such that round(n^(1/k)) divides n for all integers k>=1.

This page as a plain text file.
%I A261341 #12 Sep 27 2023 12:54:43
%S A261341 1,2,4,6,12,30,36,42,72,240,420,600,900,1560,1764,3600,6084,8100,
%T A261341 46440,1742400,4062240,35814240
%N A261341 Numbers n such that round(n^(1/k)) divides n for all integers k>=1.
%C A261341 There are no other terms below 10^16.
%C A261341 Is this a finite sequence?
%t A261341 isA[n_] :=
%t A261341 Block[{t},
%t A261341   For[k = 2, (t = Floor[1/2 + n^(1/k)]) >= 2, k++,
%t A261341    If[Mod[n, t] != 0, Return[False]]]; Return[True]]
%t A261341 Select[Range[1, 100000], isA[#] &] (* _Julien Kluge_, Apr 04 2016 *)
%o A261341 (PARI) { isA261341(n) = my(k,t); k=2; until(t<=2, t=round(sqrtn(n,k)); if(n%t,return(0)); k++); 1; }
%Y A261341 Cf. A261205, A261206
%Y A261341 Subsequence of A006446 and A261342.
%K A261341 nonn,more
%O A261341 1,2
%A A261341 _Max Alekseyev_, Aug 15 2015