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.

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

This page as a plain text file.
%I A029511 #18 Mar 13 2020 10:39:39
%S A029511 1,2,3,6,9,17,25,65,85,160,169,175,187,221,325,856,1965,2264,2309,
%T A029511 3332,4080,4182,6073,20757,23392,47345,88689,97846,672676,901816,
%U A029511 1317677,2120393,8595637
%N A029511 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 18 (most significant digit on right).
%C A029511 This sequence differs from A061947 in that all least significant zeros are kept during concatenation.
%C A029511 No more terms < 10^7. [_Lars Blomberg_, Oct 11 2011]
%H A029511 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029511 See A029495 for example.
%t A029511 b = 18; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%Y A029511 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029511 nonn,base,more
%O A029511 1,2
%A A029511 _Olivier Gérard_
%E A029511 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029511 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
%E A029511 a(29)-a(33) from _Lars Blomberg_, Oct 11 2011