|
| |
|
|
A061943
|
|
Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 14 (most significant digit on right).
|
|
1
|
|
|
|
1, 2, 6, 7, 10, 13, 39, 45, 65, 131, 195, 1690, 2005, 2106, 3211, 11615, 18498, 20881, 22360, 36335, 104858, 234506, 665223, 1274944, 1328487, 1425268, 2305498
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
This sequence differs from A029507 in that all least significant zeros are removed before concatenation.
No more terms < 10^7. - Lars Blomberg, Oct 22 2011
|
|
|
LINKS
|
Table of n, a(n) for n=1..27.
Index entries for related sequences
|
|
|
EXAMPLE
|
See A061931 for example.
|
|
|
MATHEMATICA
|
b = 14; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, IntegerDigits[IntegerReverse[#, b], b]], b], #] &] (* Robert Price, Mar 08 2020 *)
|
|
|
PROG
|
(PARI) lista(nn, m=14) = 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
|
|
|
CROSSREFS
|
Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
Sequence in context: A029459 A014862 A180626 * A029507 A047552 A287453
Adjacent sequences: A061940 A061941 A061942 * A061944 A061945 A061946
|
|
|
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
a(23)-a(27) from Lars Blomberg, Oct 22 2011
|
|
|
STATUS
|
approved
|
| |
|
|
