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

%I #16 Mar 09 2020 14:43:36

%S 1,3,9,15,16,33,285,867,5683,14205,21075,27120,31403,388601,1037577,

%T 1246064

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

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

%C No more terms < 10^7. [_Lars Blomberg_, Aug 15 2011]

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

%e See A061955 for example.

%t b = 13; c = {}; Select[Range[10^4], Divisible[FromDigits[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

%E a(15)-a(16) from _Lars Blomberg_, Aug 15 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 24 06:39 EDT 2024. Contains 371920 sequences. (Running on oeis4.)