login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089691 a={1,3,7,9} a1={1,3,7,9,0} b[n]=Flatten[Table[10*Sum[10^m*a1[[1+Mod[m,5]]],{m,0,n}]+a,{n,0,digits}]]; a(m) = if b[n] is prime then b[n] 0
11, 13, 17, 19, 311, 313, 317, 31097317, 731097313, 109731097319, 73109731097317, 7310973109731097319, 10973109731097310973109731097310973109731097317, 31097310973109731097310973109731097310973109731097317 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

A sum and digit set based prime generator function.

MATHEMATICA

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

CROSSREFS

Sequence in context: A032591 A088265 A090149 * A036979 A036977 A120168

Adjacent sequences:  A089688 A089689 A089690 * A089692 A089693 A089694

KEYWORD

nonn,base,less

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 05 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.