Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126233
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126233 Smallest number k such that (prime(k+1)+prime(k))/2 is odd and divisible by n-th odd prime. +0
8
4, 6, 8, 25, 12, 88, 78, 19, 121, 24, 29, 46, 31, 126, 186, 153, 156, 379, 197, 139, 280, 132, 285, 380, 155, 63, 334, 1005, 203, 75, 77, 516, 314, 445, 87, 1075, 93, 95, 1872, 254, 697, 1201, 270, 425, 429, 447, 304, 2187, 124, 488, 1153, 128, 335, 136, 547, 742 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

f[n_] := Block[{k = 1, c}, While[c = (Prime[k + 1] + Prime[k])/2; Mod[c, 2] == 0 || Mod[c, Prime[n + 1]] > 0, k++ ]; k]; Table[f[n], {n, 56}] (*Chandler*)

CROSSREFS

Cf. A072569, A072572, A072573, A126228, A126229, A126230, A124619, A124620, A126231, A124622.

Sequence in context: A063719 A106366 A019160 this_sequence A059889 A058011 A089330

Adjacent sequences: A126230 A126231 A126232 this_sequence A126234 A126235 A126236

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Dec 21 2006

EXTENSIONS

Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 09 2007

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research