Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079010 a(n)=nextprime[16+A022008(n)]-(16+A022008(n)); a(n) is the prime difference d>=6, following [42424] difference pattern defining A022008. +0
1
6, 14, 14, 8, 8, 14, 18, 14, 18, 8, 24, 8, 8, 8, 18, 44, 24, 38, 18, 30, 14, 14, 8, 14, 18, 8, 8, 8, 30, 8, 38, 18, 14, 14, 66, 36, 26, 30, 30, 8, 18, 14, 8, 50, 18, 18, 14, 8, 66, 26, 14, 44, 38, 54, 18, 18, 38, 30, 8, 30, 14, 24, 26, 8, 26, 14, 8, 8, 60, 26, 18, 78, 14, 8, 38, 30, 50 (list; graph; listen)
OFFSET

1,1

EXAMPLE

n=2: A022008(2)=97, corresponding sextuplet is {97,101,103,107,109,113=97+16}, nextprime[113]-113=127-113=14, so a(2)=14. Constraints for present terms: (a) are incongruent to 4 modulo 6; (b) Mod[a(n),30]={0,6,8,14,18,20,24,26}; 6 occurs only once; (c) further prohibited values like e.g. 20 etc.

MATHEMATICA

d[x_] := Prime[x+1]-Prime[x] h={k1=4, k2=2, k3=4, k4=2, k5=4} k=0; Do[If[Equal[d[n], 4]&&Equal[d[n+1], 2]&& Equal[d[n+2], 4]&&Equal[d[n+3], 2]&& Equal[d[n+4], 4], Print[d[n+5]]], {n, 1, 100000}]

CROSSREFS

Cf. A022008.

Adjacent sequences: A079007 A079008 A079009 this_sequence A079011 A079012 A079013

Sequence in context: A041070 A065938 A131902 this_sequence A015822 A023883 A107982

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jan 21 2003

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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research