This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A093506 Variation on Golomb's sequence starting with (1,2): a(n)=length of n-th run of consecutive integers with same parity. 4
 1, 2, 4, 3, 5, 7, 9, 6, 8, 10, 11, 13, 15, 17, 19, 12, 14, 16, 18, 20, 22, 24, 21, 23, 25, 27, 29, 31, 33, 35, 37, 26, 28, 30, 32, 34, 36, 39, 41, 43, 45, 47, 49, 51, 53, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 58, 60, 62, 64, 66, 68, 70 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A permutation of positive integers. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 FORMULA Does a(n)=n+o(n)? Does a(n)=n for infinitely many values of n? EXAMPLE Runs of odd or even terms are : (1),(2,4),(3,5,7,9),(6,8,10),(11,13,15,17,19),...and computing the number of integers in each run we get : 1,2,4,3,5,...the sequence itself. PROG (GNU bc) maxarray=2^16; print oe[1]=a[1]=1, ", ", a[2]=2, ", ", oe[k=0]=a[p=n=3]=4, ", "; for(max=100; p

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.