The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A061964 Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 11 (most significant digit on right). 1

%I #13 Mar 09 2020 14:43:28

%S 1,5,20,140,3400,6008,9160,24655,26265,58671,151496,265500,535860,

%T 806445,926620,990195,2675580,7153175

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

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

%C No more terms < 10^7.

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

%e See A061955 for example.

%t b = 11; c = {}; Select[Range[10^4], Divisible[FromDigits[

%t c = Join[Reverse[IntegerDigits[#, b]], c], b], #] &] (* _Robert Price_, Mar 09 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(14)-a(18) from _Lars Blomberg_, Aug 18 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 13 05:24 EDT 2024. Contains 372498 sequences. (Running on oeis4.)