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.

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

This page as a plain text file.
%I A029501 #21 Jan 14 2025 11:09:53
%S A029501 1,2,4,6,7,11,182,427,649,859,1559,5579,10577,11830,19915,533022,
%T A029501 546690,569462,673682,1050721,1233092,1621270,1771002,9151954
%N A029501 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 8 (most significant digit on right).
%C A029501 This sequence differs from A061937 in that all least significant zeros are kept during concatenation.
%C A029501 No more terms < 10^7. - _Lars Blomberg_, Oct 04 2011
%H A029501 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029501 See A029495 for example.
%t A029501 b = 8; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 12 2020 *)
%Y A029501 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029501 nonn,base,more
%O A029501 1,2
%A A029501 _Olivier Gérard_
%E A029501 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002; Aug 25, 2002
%E A029501 a(19)-a(24) from _Lars Blomberg_, Oct 04 2011