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!)
A061936 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 7 (most significant digit on right). 1

%I #21 Dec 05 2020 11:16:54

%S 1,3,12,27,48,72,79,363,600,1277,1289,1815,15272,18492,38484,83556,

%T 87312,148336,205731,222176,420900,549876,607797,624648,716064,5651851

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

%C This sequence differs from A029500 in that all least significant zeros are removed before concatenation.

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

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

%e See A061931 for example.

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

%o (PARI) lista(nn, m=7) = my(s, t); for(k=1, nn, s=k/m^valuation(k, m); 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,more

%O 1,2

%A Larry Reeves (larryr(AT)acm.org), May 24 2001

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

%E a(23)-a(26) from _Lars Blomberg_, Oct 17 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 April 25 09:09 EDT 2024. Contains 371964 sequences. (Running on oeis4.)