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.

A239222 Cubes that are divisible by each of their nonzero digits.

This page as a plain text file.
%I A239222 #17 Apr 25 2015 17:05:48
%S A239222 1,8,216,1000,2744,8000,13824,74088,125000,216000,512000,1000000,
%T A239222 1061208,2000376,2299968,2744000,4741632,5832000,8000000,8242408,
%U A239222 8489664,9261000,10941048,12812904,13824000,14886936,16003008,19683000,34012224,40001688,42144192
%N A239222 Cubes that are divisible by each of their nonzero digits.
%C A239222 Intersection of A000578 and A002796.
%H A239222 Lars Blomberg, <a href="/A239222/b239222.txt">Table of n, a(n) for n = 1..10000</a>
%F A239222 a(n) = A239221^(n)^3. - _Michel Marcus_, Mar 19 2014
%e A239222 74088 is in the sequence because 74088 is divisible by 4, 7 and 8.
%t A239222 dedQ[n_]:=And@@Divisible[n,Select[IntegerDigits[n],#>0&]]; Select[ Range[ 400]^3, dedQ] (* _Harvey P. Dale_, Apr 25 2015 *)
%o A239222 (PARI) isOK(n) = my(v=vecsort(digits(n^3), , 8)); for(i=1+(v[1]==0), #v, if(n^3%v[i], return(0))); 1
%o A239222 s=[]; for(n=1, 1000, if(isOK(n), s=concat(s, n^3))); s
%Y A239222 Cf. A239219, A239220, A239221.
%Y A239222 Cf. A000578, A002796.
%K A239222 nonn,base
%O A239222 1,2
%A A239222 _Colin Barker_, Mar 12 2014