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.

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

This page as a plain text file.
%I A029533 #26 Jan 13 2025 13:23:01
%S A029533 1,3,5,9,15,19,21,43,57,255,345,385,505,1131,1395,1585,7205,11565,
%T A029533 38949,270425,684555,8311925
%N A029533 Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 16 (most significant digit on right and removing all least significant zeros before concatenation).
%C A029533 This sequence differs from A061969 in that all least significant zeros are removed before concatenation.
%C A029533 No more terms < 10^7. [_Lars Blomberg_, Sep 20 2011]
%H A029533 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029533 See A029519 for example.
%t A029533 b = 16; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%Y A029533 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029533 nonn,base,more
%O A029533 1,2
%A A029533 _Olivier Gérard_
%E A029533 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029533 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), Jun 04 2001
%E A029533 a(21)-a(22) from _Lars Blomberg_, Sep 20 2011