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.

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

This page as a plain text file.
%I A029502 #21 Dec 05 2020 23:31:15
%S A029502 1,3,32,320,544,2048,3331,5833,32281,125120,145760,317621,889760,
%T A029502 7371043
%N A029502 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 9 (most significant digit on right).
%C A029502 This sequence differs from A061938 in that all least significant zeros are kept during concatenation.
%C A029502 No more terms < 10^7. - _Lars Blomberg_, Oct 04 2011
%H A029502 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029502 See A029495 for example.
%t A029502 b = 9; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 12 2020 *)
%o A029502 (PARI) lista(nn, m=9) = my(s, t); for(k=1, nn, s=k; while(s, t=t*m+s%m; s\=m); if(t%k==0, print1(k, ", "))); \\ _Jinyuan Wang_, Dec 05 2020
%Y A029502 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029502 nonn,base,more
%O A029502 1,2
%A A029502 _Olivier Gérard_
%E A029502 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029502 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
%E A029502 a(13)-a(14) from _Lars Blomberg_, Oct 04 2011