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.
%I A256865 #16 Jun 29 2019 03:54:05 %S A256865 0,6,10,30,50,60,110,126,150,156,168,180,210,231,250,260,300,310,378, %T A256865 550,630,660,726,750,756,780,810,840,900,930,1008,1050,1250,1260,1300, %U A256865 1310,1320,1380,1410,1500,1510,1530,1550,1560,1680,1760,1870,1890,1960,2016,2268,2310,2331,2618,2750,2860,3124,3126,3150,3156,3180 %N A256865 Numbers divisible by prime(d+1) for each digit d of their base-5 representation. %C A256865 The base-5 variant of A256882 - A256884, A256866 - A256870 in bases 2, ..., 10. %C A256865 A variant of A256875 where digits 0 are forbidden and divisibility by prime(d) is required. %e A256865 0 is divisible by prime(0+1)=2. %e A256865 6 = 11_5 and is divisible by prime(1+1)=3. %e A256865 10 = 20_5 and is divisible by prime(0+1)=2 and by prime(2+1)=5. %e A256865 n = 1, 2, 3, 4 are not divisible by prime(n+1) = 3, 5, 7, 11. 5=10_5 is not divisible by prime(0+1)=2; 7=12_5 is not divisible by prime(2+1)=5, etc. %o A256865 (PARI) is(n,b=5)=!for(i=1,#d=Set(digits(n,b)),n%prime(d[i]+1)&&return) %Y A256865 Cf. A256882, A256883, A256884, A256866-A256870, A256874-A256879, A256786. %K A256865 nonn,base %O A256865 1,2 %A A256865 _M. F. Hasler_, Apr 11 2015