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!)
A202101 Numbers n such that 90*n + 59 is prime. 10

%I #12 Feb 17 2017 14:28:30

%S 0,1,2,4,5,6,11,13,14,15,16,21,22,23,25,26,28,32,34,35,36,37,40,43,44,

%T 47,51,54,55,56,57,58,62,67,69,70,71,74,76,78,81,83,89,93,95,96,99,

%U 100,102,104,107,112,116,117,120,121,126,127,128,132,134,138

%N Numbers n such that 90*n + 59 is prime.

%C This sequence was generated by adding 12 Fibonacci-like sequences (see: PROG]. Looking at 90n+59 modulo 9 and modulo 10 we see that all entries of A142319 have digital root 5 and last digit 9. (Reverting the process is an application of the Chinese remainder theorem)

%t Select[Range[0, 200], PrimeQ[90 # + 59] &]

%o (PARI) is(n)=isprime(90*n+59) \\ _Charles R Greathouse IV_, Feb 17 2017

%Y Cf. A181732, A198382, A195993, A196000, A196007, A201739, A201734, A201804, A201816, A201817, A201818, A201820, A201822.

%K nonn,easy

%O 1,3

%A _J. W. Helkenberg_, Dec 11 2011

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 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)