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.

A239219 Numbers n such that n^3 is not divisible by any of its nonzero digits.

This page as a plain text file.
%I A239219 #10 Aug 20 2022 11:55:42
%S A239219 3,7,19,29,37,43,46,59,67,77,79,86,89,127,143,149,157,163,167,169,179,
%T A239219 187,197,199,287,299,307,313,323,337,349,353,359,367,377,379,389,397,
%U A239219 403,419,437,443,457,460,463,587,589,593,607,613,643,647,649,653,667
%N A239219 Numbers n such that n^3 is not divisible by any of its nonzero digits.
%H A239219 Lars Blomberg, <a href="/A239219/b239219.txt">Table of n, a(n) for n = 1..10000</a>
%e A239219 37 is in the sequence because 37^3 = 50653 which is not divisible by 3, 5 or 6.
%t A239219 n3ndQ[n_]:=Module[{nzd=DeleteCases[IntegerDigits[n^3],0]},NoneTrue[ n^3/nzd,IntegerQ]]; Select[Range[700],n3ndQ] (* _Harvey P. Dale_, Aug 20 2022 *)
%o A239219 (PARI) isOK(n) = my(v=vecsort(digits(n^3), , 8)); for(i=1+(v[1]==0), #v, if(n^3%v[i]==0, return(0))); 1
%o A239219 s=[]; for(n=1, 1000, if(isOK(n), s=concat(s, n))); s
%Y A239219 Cf. A239220, A239221, A239222.
%K A239219 nonn,base
%O A239219 1,1
%A A239219 _Colin Barker_, Mar 12 2014