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!)
A089690 a={1,3,7,9} a1={1,3,7,9,0} b[n]=Flatten[Table[10*Sum[10^m*a1[[1+Mod[n,5]]],{m,0,n}]+a,{n,0,digits}]]; a[m]=if b[n] is prime then b[n] 0

%I #6 Mar 30 2012 17:34:14

%S 3,7,11,13,17,19,331,337,99991,33333331,777777773,11111111111111119,

%T 333333333333333331,999999999999999999999999999999999999999999991,

%U 333333333333333333333333333333333333333333333333333333333333333333333333333331

%N a={1,3,7,9} a1={1,3,7,9,0} b[n]=Flatten[Table[10*Sum[10^m*a1[[1+Mod[n,5]]],{m,0,n}]+a,{n,0,digits}]]; a[m]=if b[n] is prime then b[n]

%C A strange set of primes from a prime generator function experiment.

%C The digit repeatings in these numbers which are primes make them interesting. It doesn't seem like they should be primes.

%t a={1, 3, 7, 9} a1={1, 3, 7, 9, 0} digits=100 b=Flatten[Table[10*Sum[10^m*a1[[1+Mod[n, 5]]], {m, 0, n}]+a, {n, 0, digits}]]; c=Table[If[PrimeQ[b[[n]]]==True, b[[n]], 0], {n, 1, Dimensions[b][[1]]}] d=Delete[Union[c], 1]

%K nonn,base,less

%O 1,1

%A _Roger L. Bagula_, Jan 05 2004

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 August 1 14:26 EDT 2024. Contains 374818 sequences. (Running on oeis4.)