[seqfan] Re: Divisibility by primes

[M. F. Hasler]

On Sat, Apr 11, 2015 at 6:53 AM, Benoît Jubin <benoit.jubin at gmail.com> wrote:
> The corresponding sequence in base 2 is empty, and in base 3, it is given by
> a_3(n) = (9^n-1)/2,
> that is, numbers whose representation in base 3 is 111......111 with an
> even number of 1's.
> This is particular since the base itself is prime.
> It might be worth computing the sequence in bases 4 and 5.

I propose A256874...A256879 for bases 4..9
and ...A256870 for the variant(s) where digits 0 are allowed but
divisibility by prime(d+1) is required instead.
-- 
Maximilian

>
>> > -----Ursprungligt meddelande-----
>> > Från: SeqFan [mailto:seqfan-bounces at list.seqfan.eu] För Eric Angelini
>> > Skickat: den 10 april 2015 13:02
>> > Till: Sequence Discussion list
>> > Ämne: [seqfan] Divisibility by primes
>> >
>> >
>> > Hello SeqFans,
>> > 12 is divisible by the 1st and the 2nd prime
>> > 14 is divisible by the 1st and the 4th prime
>> > 42 is divisible by the 4th and the 2nd prime ...
>> > Are there many others?
>> > (yes, an infinity: 222, 222222, 222222222, etc) Best, É.
>> > Catapulté de mon aPhone
>> >
>> > _______________________________________________