login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A244211
Integers n such that for every integer k>0, n*6^k-1 has a divisor in the set { 7, 13, 31, 37, 43 }.
3
133946, 213410, 299144, 33845, 367256, 803676, 1214450, 1250446, 1280460, 1704478, 1780150, 1792762, 1794864, 2003070, 2004962, 2203536, 2798489, 3014465, 3027709, 3041998, 3053350, 3194549, 3326301, 4244794
OFFSET
1,1
COMMENTS
For n > 24 a(n) = a(n-24) + 4488211, the first 24 values are in the data.
When the number a(n) has 1 or 6 as the last digit, the number a(n)*6^k-1 is always divisible by 5 and always has another divisor in the set { 7, 13, 31, 37, 97 } for every k.
FORMULA
For n > 24, a(n) = a(n-24) + 4488211.
PROG
(PFGW & SCRIPT)
SCRIPT
DIM k, 1
DIM n
DIMS t
OPENFILEOUT myf, res.txt
LABEL loop1
SET k, k+1
SET n, 0
LABEL loop2
SET n, n+1
IF n>500 THEN GOTO a
IF (k*6^n-1)%7==0 THEN GOTO loop2
IF (k*6^n-1)%13==0 THEN GOTO loop2
IF (k*6^n-1)%31==0 THEN GOTO loop2
IF (k*6^n-1)%37==0 THEN GOTO loop2
IF (k*6^n-1)%43==0 THEN GOTO loop2
GOTO loop1
LABEL a
WRITE myf, k
PRINT k
GOTO loop1
KEYWORD
nonn
AUTHOR
Pierre CAMI, Jun 23 2014
STATUS
approved