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.

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

This page as a plain text file.
%I A029509 #22 Jan 14 2025 11:09:45
%S A029509 1,2,3,4,5,6,8,9,10,12,15,25,45,163,234,661,1034,1191,1415,1835,2094,
%T A029509 3143,3284,3459,3638,3915,5215,16620,18505,18790,31965,36600,140835,
%U A029509 175302,187170,190545,283115,6926085,7607655
%N A029509 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 16 (most significant digit on right).
%C A029509 This sequence differs from A061945 in that all least significant zeros are kept during concatenation.
%C A029509 No more terms < 10^7. [_Lars Blomberg_, Oct 09 2011]
%H A029509 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029509 See A029495 for example.
%t A029509 b = 16; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%Y A029509 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029509 nonn,base,more
%O A029509 1,2
%A A029509 _Olivier Gérard_
%E A029509 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029509 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
%E A029509 a(38)-a(39) from _Lars Blomberg_, Oct 09 2011