|
|
A211005
|
|
Pair (i, j) where i = number of adjacent nonprimes and j = number of adjacent primes.
|
|
4
|
|
|
1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 5, 1, 1, 1, 5, 1, 3, 1, 1, 1, 3, 1, 5, 1, 5, 1, 1, 1, 5, 1, 3, 1, 1, 1, 5, 1, 3, 1, 5, 1, 7, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 13, 1, 3, 1, 5, 1, 1, 1, 9, 1, 1, 1, 5, 1, 5, 1, 3, 1, 5, 1, 5, 1, 1, 1, 9, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
----------------------------------------------------------
. Array from Number of Number of
----------------------------------------------------------
1 1; 1 0 1
2 2, 3; 0 2 2
3 4; 1 0 1
4 5; 0 1 1
5 6; 1 0 1
6 7; 0 1 1
7 8, 9, 10; 3 0 3
8 11; 0 1 1
9 12; 1 0 1
10 13; 0 1 1
11 14, 15, 16; 3 0 3
12 17; 0 1 1
13 18; 1 0 1
14 19; 0 1 1
15 20, 21, 22; 3 0 3
16 23; 0 1 1
17 24, 25, 26, 27, 28; 5 0 5
18 29; 0 1 1
19 30; 1 0 1
20 31; 0 1 1
|
|
MATHEMATICA
|
A211005[upto_]:=Map[Length, Most[Split[PrimeQ[Range[upto]]]]];
|
|
PROG
|
(Haskell)
import Data.List (group)
a211005 n = a211005_list !! (n-1)
a211005_list = map length $ group a069754_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|