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

%I #15 Mar 09 2020 14:43:49

%S 1,7,28,77,211,308,343,553,791,2177,3928,46519

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

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

%C No more terms < 10^7. - _Lars Blomberg_, Aug 09 2011

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

%e See A061955 for example.

%t b = 15; 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

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 23 09:48 EDT 2024. Contains 371905 sequences. (Running on oeis4.)