Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096475
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096475 a[n] is the smallest (lesser twin) prime such that A096474(n)=2n, i.e. prime[2+a[n]]-prime[a[n]]=2n. +0
2
3, 17, 11, 41, 71, 101, 29, 569, 881, 137, 1151, 521, 1289, 2027, 10331, 1229, 3461, 461, 2549, 2129, 6569, 6131, 14387, 34157, 5657, 4259, 44621, 17387, 25301, 11159, 56099, 34367, 64877, 23201, 80147, 73361, 21017, 46349 (list; graph; listen)
OFFSET

3,1

FORMULA

a[n]=Min{x; A096474[x]=2n} for n=3, 4, ...

MATHEMATICA

{ta=Table[0, {1300}], tb=Table[0, {1300}], tc=Table[0, {1300}], u=1}; Do[s=Prime[n+1]-Prime[n]; If[Equal[s, 2], ta[[u]]=Prime[Prime[n+1]]-Prime[Prime[n]]; tb[[u]]=n; tc[[u]]=Prime[n]; u=u+1], {n, 1, 10000}]; ta

CROSSREFS

Cf. A001359, A096474, A096476.

Sequence in context: A124689 A093844 A033467 this_sequence A088122 A087964 A120448

Adjacent sequences: A096472 A096473 A096474 this_sequence A096476 A096477 A096478

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 23 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research