|
| |
|
|
A029531
|
|
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 14 (most significant digit on right).
|
|
1
|
|
|
|
1, 13, 55, 99, 167, 185, 195, 1921, 4979, 14859, 37605, 48005, 88569, 122223, 278403, 394433, 1979771, 2082769, 2352363, 7323381
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
This sequence differs from A061967 in that all least significant zeros are removed before concatenation.
No more terms < 10^7. - Lars Blomberg, Sep 17 2011
|
|
|
LINKS
|
Table of n, a(n) for n=1..20.
Index entries for related sequences
|
|
|
EXAMPLE
|
See A029519 for example.
|
|
|
MATHEMATICA
|
b = 14; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* Robert Price, Mar 13 2020 *)
|
|
|
PROG
|
(PARI) lista(nn, m=14) = my(c, s, t); for(k=1, nn, t+=m^c*s=fromdigits(Vecrev(digits(k, m)), m); c+=logint(s, m)+1; 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: A071230 A027000 A198160 * A158485 A274973 A005902
Adjacent sequences: A029528 A029529 A029530 * A029532 A029533 A029534
|
|
|
KEYWORD
|
nonn,base,more
|
|
|
AUTHOR
|
Olivier Gérard
|
|
|
EXTENSIONS
|
Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
a(17)-a(20) from Lars Blomberg, Sep 17 2011
|
|
|
STATUS
|
approved
|
| |
|
|
