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.

A256866 Numbers divisible by prime(d+1) for each digit d of their base-6 representation.

This page as a plain text file.
%I A256866 #16 Jun 29 2019 03:54:09
%S A256866 0,6,21,36,42,126,216,222,252,258,273,300,480,510,525,560,693,735,756,
%T A256866 770,777,880,924,1001,1012,1296,1302,1320,1326,1332,1338,1380,1482,
%U A256866 1512,1518,1548,1554,1560,1590,1638,1716,1740,1770,1785,1800,1995,2058,2079,2310,2418
%N A256866 Numbers divisible by prime(d+1) for each digit d of their base-6 representation.
%C A256866 The base-6 variant of A256882 - A256884, A256866 - A256870 in bases 2, ..., 10.
%C A256866 A variant of A256876 where digits 0 are forbidden and divisibility by prime(d) is required.
%e A256866 0 is divisible by prime(0+1)=2.
%e A256866 6 = 10_6 in base 6, and is divisible by prime(1+1)=3 and by prime(0+1)=2.
%e A256866 21 = 33_6, and is divisible by prime(3+1)=7.
%e A256866 n = 1, 2, 3, 4, 5 are not divisible by prime(n+1) = 3, 5, 7, 11, 13, respectively. 7=11_6, 8=12_6, 10=13_6, ... are not divisible by prime(1+1)=3; 9=12_7 is not divisible by prime(2+1)=5, etc.
%o A256866 (PARI) is(n,b=6)=!for(i=1,#d=Set(digits(n,b)),n%prime(d[i]+1)&&return)
%Y A256866 Cf. A256882, A256883, A256884, A256865-A256870, A256874-A256879, A256786.
%K A256866 nonn,base
%O A256866 1,2
%A A256866 _M. F. Hasler_, Apr 11 2015