A029533 Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 16 (most significant digit on right).

1, 3, 5, 9, 15, 19, 21, 43, 57, 255, 345, 385, 505, 1131, 1395, 1585, 7205, 11565, 38949, 270425, 684555, 8311925

Offset

1,2

Comments

This sequence differs from A061969 in that all least significant zeros are removed before concatenation.

No more terms < 10^7. [Lars Blomberg, Sep 20 2011]

Links

Table of n, a(n) for n=1..22.

Index entries for related sequences

Example

See A029519 for example.

Mathematica

b = 16; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* Robert Price, Mar 13 2020 *)

Crossrefs

Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.

Sequence in context: A190939 A018634 A310041 * A350166 A018685 A107994

Adjacent sequences: A029530 A029531 A029532 * A029534 A029535 A029536

Keyword

nonn,base,more

Author

Olivier Gérard

Extensions

Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002

Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), Jun 04 2001

a(21)-a(22) from Lars Blomberg, Sep 20 2011

Status

approved