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.

A061948 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 A061948 #15 Mar 08 2020 20:55:02
%S A061948 1,3,9,27,29,36,39,53,72,108,180,189,360,900,1008,1885,1899,2877,3120,
%T A061948 4272,6975,14319,16203,18724,19959,24777,30071,38376,84748,85053,
%U A061948 90843,108412,121996,155556,327321,366128,545949,727236,1332360,1847072,3090195,3229872
%N A061948 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 19 (most significant digit on right).
%C A061948 This sequence differs from A029512 in that all least significant zeros are removed before concatenation.
%C A061948 No more terms < 10^7. [_Lars Blomberg_, Oct 23 2011]
%H A061948 <a href="/index/N#concat">Index entries for related sequences</a>
%e A061948 See A061931 for example.
%t A061948 b = 19; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, IntegerDigits[IntegerReverse[#, b], b]], b], #] &] (* _Robert Price_, Mar 08 2020 *)
%Y A061948 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A061948 nonn,base
%O A061948 1,2
%A A061948 Larry Reeves (larryr(AT)acm.org), May 24 2001
%E A061948 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002; Aug 25, 2002
%E A061948 a(40)-a(42) from _Lars Blomberg_, Oct 23 2011