|
|
A173658
|
|
Similar to A093506, but starting with 2, 4.
|
|
1
|
|
|
2, 4, 1, 3, 5, 7, 6, 9, 11, 13, 8, 10, 12, 14, 16, 15, 17, 19, 21, 23, 25, 27, 18, 20, 22, 24, 26, 28, 29, 31, 33, 35, 37, 39, 41, 43, 45, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 52, 54, 56, 58, 60, 62, 64, 66
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Maximal runs of constant parity: (2,4),(1,3,5,7),(6),(9,11,13),(8,10,12,14,16),(15,17,19,21,23,25,27),(18,20,22,24,26,28),...
Lengths of the runs: 2, 4, 1, 3, 5, 7, 6,..., which is the sequence itself (and a permutation of the natural numbers).
|
|
REFERENCES
|
From a posting to the Sequence Fans Mailing List by Eric Angelini, Nov 22 2010
|
|
LINKS
|
|
|
PROG
|
(bc) /*GNU bc*/ maxarray=2^16; print a[1]=2, ", ", oe[k=0]=a[p=n=2]=4, ", "; oe[1]=-1; max=100; for(; p<maxarray&&n<max; p++)for(i=0*k=!k; i<a[p]&&n<max; i++){an=oe[k]+=2; if(++n<maxarray)a[n]=an; print an, ", "}; print"\n"
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|