login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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
CROSSREFS
Sequence in context: A023046 A034213 A226112 * A234206 A133528 A151940
KEYWORD
nonn
AUTHOR
Pierre CAMI, Jun 23 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)