OFFSET
1,3
COMMENTS
This sequence results from the propagation (addition) of 12 Fibonacci-like sequences; this sequence contains (recovers) all digital root 1 and last digit 3 prime numbers.
LINKS
Ivan Neretin, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = (A142326(n)-73)/90.
MAPLE
A142326 := proc(n)
option remember;
if n = 1 then
73 ;
else
a := nextprime(procname(n-1)) ;
while (a mod 45) <> 28 do
a := nextprime(a) ;
end do;
return a;
end if;
end proc:
A195993 := proc(n)
(A142326(n)-73)/90 ;
end proc:
seq(A195993(n), n=1..80) ; # R. J. Mathar, Oct 31 2011
MATHEMATICA
Select[Range[0, 200], PrimeQ[90#+73]&] (* Harvey P. Dale, May 05 2014 *)
PROG
(PARI) is(n)=isprime(90*n+73) \\ Charles R Greathouse IV, Apr 25 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
J. W. Helkenberg, Oct 27 2011
STATUS
approved