|
| |
|
|
A333448
|
|
Smallest positive divisibility coefficient of A045572(n).
|
|
1
|
|
|
|
1, 1, 5, 1, 10, 4, 12, 2, 19, 7, 19, 3, 28, 10, 26, 4, 37, 13, 33, 5, 46, 16, 40, 6, 55, 19, 47, 7, 64, 22, 54, 8, 73, 25, 61, 9, 82, 28, 68, 10, 91, 31, 75, 11, 100, 34, 82, 12, 109, 37, 89, 13, 118, 40, 96, 14, 127, 43, 103, 15, 136, 46, 110, 16, 145, 49, 117
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
The sequence was generated in an attempt to create a universal divisibility test. Namely, taking the last digit of the number inspected, multiplying it by a number (the "divisibility coefficient"), and adding it to the inspected number without the last digit. Then, if the result is divisible by the number we are checking, so is our original number. This test works only for numbers coprime to 10, hence the sequence is based on A045572. The sequence lists the smallest positive divisibility coefficients of the members of A045572.
|
|
|
LINKS
|
|
|
|
FORMULA
|
The sequence can be defined piecewise: 9m+1 for numbers of the form 10m+1; 3m+1 for numbers of the form 10m+3; 7m+5 for numbers of the form 10m+7 and m+1 for numbers of the form 10m+9.
a(n) = 1/10 - (1 - 2*(floor((n + 1)/4) + n))*(1 - (1 + (floor(16*9^n/205) mod 9))/10).
a(n) = b(n) - (((b(n) mod 10)^3 mod 10)*b(n) - 1)/10, where b(n) = A045572(n). (End)
|
|
|
EXAMPLE
|
For example, let us check whether 21 is divisible by 7. First, we take off the last digit, 1. Since 7 is the third member of A045572, its divisibility coefficient is the third member of this sequence, namely 5. Then we multiply 5 times 1 to obtain 5, and we add it to the original number without the last digit, in our case, 2. We get 7, and since it is clearly divisible by 7, so is 21.
|
|
|
MATHEMATICA
|
Array[# - (# Mod[PowerMod[#, 3, 10], 10] - 1)/10 &[1/2*(5*# + Mod[3*# + 2, 4] - 4)] &, 67] (* Michael De Vlieger, Oct 05 2020 *)
|
|
|
PROG
|
(PARI) lista(nn) = {for (n=1, nn, if (gcd(n, 10) == 1, my(m=n % 10, k=n\10, x); if (m == 1, x = 9*k+1); if (m == 3, x = 3*k+1); if (m == 7, x = 7*k+5); if (m == 9, x = k+1); print1(x, ", "); ); ); } \\ Michel Marcus, May 04 2020
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
