( PFGW & SCRIPT )
( PFGW & SCRIPT )
proposed
approved
editing
proposed
IF (k*10^n-1)%3==0 THEN GOTO loop2
proposed
editing
editing
proposed
Integers n not of form 3m+1 such that for any integer k>0 , n*10^k-1 has a divisor in the set { 3, 7, 11, 13, 37 }.
If n is of form 3m+1 then n*10^k-1 is always divisible by 3. - Jens Kruse Andersen, Jul 09 2014
10176*10^k-1 is divisible by 11 for k of form 6m, 6m+2, 6m+4, by 7 for k of form 6m+1, by 37 for 6m+3 (and also 6m), and by 13 for 6m+5. This covers all k. {7, 11, 13, 37} is called a covering set. - Jens Kruse Andersen, Jul 09 2014
Definition corrected by Jens Kruse Andersen, Jul 09 2014
proposed
editing
editing
proposed
Integers n such that for any integer k>0 n*10n10^k-1 has a divisor in the set { 3, 7, 11, 13, 37 }.
proposed
editing
editing
proposed
For n>24 a(n) = a(n-24) + 111111. The , the first 24 values are in the data.
proposed
editing