|
Search: id:A061933
|
|
|
| A061933 |
|
Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 4 (most significant digit on right). |
|
+0
2
|
|
| 1, 2, 3, 9, 15, 21, 162, 495, 614, 813, 174913, 240389, 704162
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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
|
|
LINKS
|
Index entries for related sequences
|
|
EXAMPLE
|
See A061931 for example.
|
|
CROSSREFS
|
Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
Sequence in context: A056702 A091361 A092352 this_sequence A124881 A054416 A092638
Adjacent sequences: A061930 A061931 A061932 this_sequence A061934 A061935 A061936
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
Larry Reeves (larryr(AT)acm.org), May 24 2001
|
|
EXTENSIONS
|
Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12, 2002
One more term. Next term exceeds 10000000. Sean A. Irvine (sairvin(AT)xtra.co.nz), Sep 03 2009
|
|
|
Search completed in 0.002 seconds
|
