login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029506 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 13 (most significant digit on right). 1

%I #19 Dec 05 2020 23:31:22

%S 1,3,9,15,21,25,35,47,48,87,240,320,672,896,1760,2592,2688,3659,5152,

%T 15456,16800,53200,60288,75360,92605,92736,121600,189648,204176,

%U 334827,382368,401472,443919,1070720,1836855,2010432,4384128,5566077

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

%C This sequence differs from A061942 in that all least significant zeros are kept during concatenation.

%C No more terms < 10^7. - _Lars Blomberg_, Oct 07 2011

%H <a href="/index/N#concat">Index entries for related sequences</a>

%e See A029495 for example.

%t b = 13; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 12 2020 *)

%o (PARI) lista(nn, m=13) = 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 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.

%K nonn,base

%O 1,2

%A _Olivier GĂ©rard_

%E Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002

%E Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001

%E a(33)-a(38) from _Lars Blomberg_, Oct 07 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 23:32 EDT 2024. Contains 372298 sequences. (Running on oeis4.)