A029497 -id:A029497 - cp's OEIS frontend

A061933 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 4 (most significant digit on right, least significant zeros not written).

1, 2, 3, 9, 15, 21, 162, 495, 614, 813, 174913, 240389, 704162

Offset: 1

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

This sequence differs from A029497 in that all least significant zeros are removed before concatenation.
The next term is > 400000. - Larry Reeves, Jan 16 2002
Next term exceeds 10000000. - Sean A. Irvine, Sep 03 2009

			See A061931 for example.

Index entries for related sequences

Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.

b = 4; c = {}; Select[Range[10^4], Divisible[FromDigits[
c = Join[c, IntegerDigits[IntegerReverse[#, b], b]], b], #] &] (* Robert Price, Mar 07 2020 *)

lista(nn, m=4) = 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

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

a(13) from Sean A. Irvine, Sep 03 2009

cp's OEIS Frontend

A061933 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 4 (most significant digit on right, least significant zeros not written).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions