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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139327 Write the first n^2 odd numbers consecutively in n rows of length n: a(n) = maximal number of primes in a row. 2
0, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 8, 8, 9, 10, 10, 10, 11, 11, 12, 13, 13, 14, 14, 14, 15, 15, 15, 16, 17, 17, 17, 18, 18, 19, 20, 20, 20, 21, 21, 22, 22, 22, 23, 23, 23, 23, 24, 24, 25, 26, 26, 27, 28, 28, 29, 29, 29, 29, 29, 29, 29, 30, 30, 31, 31, 31, 32, 33, 33, 33, 33, 33 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(n) = Max{A139325(n,k): 1<=k<=n}.

EXAMPLE

a(4)=Max{#{3,5,7},#{11,13},#{17,19,23},#{29,31}}=Max{3,2,3,2}=3:

..1 ...3 ...5 ...7 ... primes in first row = {3,5,7},

..9 ..11 ..13 ..15 ... primes in 2nd row = {11,13},

.17 ..19 ..21 ..23 ... primes in 3rd row = {17,19},

.25 ..27 ..29 ..31 ... primes in 4th row = {29,31}.

CROSSREFS

Cf. A139326.

Sequence in context: A038128 A097337 A163464 * A076905 A098295 A074840

Adjacent sequences:  A139324 A139325 A139326 * A139328 A139329 A139330

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 14 2008

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 16 11:30 EST 2012. Contains 205907 sequences.