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.

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

This page as a plain text file.
%I A029539 #22 Jan 13 2025 13:24:40
%S A029539 1,3,7,9,21,51,483,687,919,1095,1395,3117,3649,25329,46487,47963,
%T A029539 65541,71547,182949,228057,231483,759747,2420481,3156489,3781071,
%U A029539 5290915
%N A029539 Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 22 (most significant digit on right and removing all least significant zeros before concatenation).
%C A029539 This sequence differs from A061975 in that all least significant zeros are removed before concatenation.
%C A029539 No more terms < 10^7. [_Lars Blomberg_, Sep 27 2011]
%H A029539 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029539 See A029519 for example.
%t A029539 b = 22; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%Y A029539 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029539 nonn,base,more
%O A029539 1,2
%A A029539 _Olivier Gérard_
%E A029539 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029539 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), Jun 04 2001
%E A029539 a(22)-a(26) from _Lars Blomberg_, Sep 27 2011