The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A202114 Numbers n such that 90n + 53 is prime. 3
0, 2, 5, 6, 7, 8, 9, 10, 13, 16, 17, 24, 26, 29, 30, 31, 33, 35, 42, 43, 44, 47, 48, 49, 51, 52, 55, 58, 64, 65, 68, 69, 70, 75, 77, 80, 82, 83, 85, 86, 87, 91, 93, 94, 96, 97, 99, 103, 104, 112, 113, 114, 120, 124, 126, 127, 132, 134, 135, 138, 140, 141 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This sequence was generated by adding 12 Fibonacci-like sequences [See: PROG]. Looking at the format 90n+53 modulo 9 and modulo 10 we see that all entries of A142316 have digital root 8 and last digit 3. (Reverting the process is an application of the Chinese remainder theorem.) The 12 Fibonacci-like sequences are generated (via the p and q "seed" values entered into the PERL program) from the base p,q pairs 53*91, 19*17, 37*89, 73*71, 11*13, 29*67, 47*49, 83*31, 23*61, 41*43, 59*7, 77*79.
LINKS
MATHEMATICA
Select[Range[0, 200], PrimeQ[90 # + 53] &]
PROG
(PARI) is(n)=isprime(90*n+53) \\ Charles R Greathouse IV, Feb 20 2017
CROSSREFS
Sequence in context: A039097 A047581 A039067 * A228090 A287440 A111175
KEYWORD
nonn,easy
AUTHOR
J. W. Helkenberg, Dec 11 2011
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 June 10 00:07 EDT 2024. Contains 373251 sequences. (Running on oeis4.)