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.

A029512 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 19 (most significant digit on right).

This page as a plain text file.
%I A029512 #16 Jan 14 2025 10:01:06
%S A029512 1,3,9,23,24,27,40,45,72,120,135,141,145,161,243,360,520,801,1272,
%T A029512 1279,1512,2568,2681,3921,4584,7155,8704,12389,22405,27649,32640,
%U A029512 34720,40455,62755,65568,89163,120240,125671,144144,193680,204080,241200,302160,437040
%N A029512 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 19 (most significant digit on right).
%C A029512 This sequence differs from A061948 in that all least significant zeros are kept during concatenation.
%H A029512 Lars Blomberg, <a href="/A029512/b029512.txt">Table of n, a(n) for n=1..59</a> (all terms below 10^7)
%e A029512 See A029495 for example.
%t A029512 b = 19; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%Y A029512 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029512 nonn,base
%O A029512 1,2
%A A029512 _Olivier Gérard_
%E A029512 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), Jun 01 2001