login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A256865
Numbers divisible by prime(d+1) for each digit d of their base-5 representation.
14
0, 6, 10, 30, 50, 60, 110, 126, 150, 156, 168, 180, 210, 231, 250, 260, 300, 310, 378, 550, 630, 660, 726, 750, 756, 780, 810, 840, 900, 930, 1008, 1050, 1250, 1260, 1300, 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
OFFSET
1,2
COMMENTS
The base-5 variant of A256882 - A256884, A256866 - A256870 in bases 2, ..., 10.
A variant of A256875 where digits 0 are forbidden and divisibility by prime(d) is required.
EXAMPLE
0 is divisible by prime(0+1)=2.
6 = 11_5 and is divisible by prime(1+1)=3.
10 = 20_5 and is divisible by prime(0+1)=2 and by prime(2+1)=5.
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.
PROG
(PARI) is(n, b=5)=!for(i=1, #d=Set(digits(n, b)), n%prime(d[i]+1)&&return)
KEYWORD
nonn,base
AUTHOR
M. F. Hasler, Apr 11 2015
STATUS
approved