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.

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

This page as a plain text file.
%I A029540 #22 Jan 13 2025 13:24:55
%S A029540 1,11,35,44,121,605,2156,8492,8844,9152,58300,134023,172051,181092,
%T A029540 190124,200656,261063,287101,746493,779471,3080351,7868996,8724407
%N A029540 Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 23 (most significant digit on right and removing all least significant zeros before concatenation).
%C A029540 This sequence differs from A061976 in that all least significant zeros are removed before concatenation.
%C A029540 No more terms < 10^7. [_Lars Blomberg_, Sep 29 2011]
%H A029540 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029540 See A029519 for example.
%t A029540 b = 23; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%Y A029540 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029540 nonn,base,more
%O A029540 1,2
%A A029540 _Olivier Gérard_
%E A029540 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029540 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
%E A029540 a(19)-a(23) from _Lars Blomberg_, Sep 29 2011