A030599 -id:A030599 - cp's OEIS frontend

A030588 Write odd numbers in base 6 and juxtapose.

1, 3, 5, 1, 1, 1, 3, 1, 5, 2, 1, 2, 3, 2, 5, 3, 1, 3, 3, 3, 5, 4, 1, 4, 3, 4, 5, 5, 1, 5, 3, 5, 5, 1, 0, 1, 1, 0, 3, 1, 0, 5, 1, 1, 1, 1, 1, 3, 1, 1, 5, 1, 2, 1, 1, 2, 3, 1, 2, 5, 1, 3, 1, 1, 3, 3, 1, 3, 5, 1, 4, 1, 1, 4, 3, 1, 4, 5, 1, 5, 1, 1, 5, 3, 1, 5, 5, 2, 0, 1

Offset: 1

Clark Kimberling

			From _Antti Karttunen_, Dec 26 2018: (Start)
The first twelve odd numbers and their base-6 representations (A007092) are:
    1    1
    3    3
    5    5
    7   11
    9   13
   11   15
   13   21
   15   23
   17   25
   19   31
   21   33
   23   35
thus the sequence begins with terms 1, 3, 5, 1, 1, 1, 3, 1, 5, 2, 1, 2, 3, 2, 5, 3, 1, 3, 3, 3, 5.
(End)

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A007092.
Cf. A030589, A030590, A030591, A030592, A030593, A030594.
Cf. A030595, A030601, A030602, A030603.
Cf. A030596, A030597, A030598, A030599, A030600.

Flatten[Table[IntegerDigits[2n - 1, 6], {n, 50}]] (* Harvey P. Dale, Jul 22 2012 *)

up_to = 100000;
A030588list(up_to) = { my(v=vector(up_to),ds=List([]),o=1,j=1); for(i=1,up_to,if(j>#ds,ds=digits(o,6);j=1;o+=2); v[i] = ds[j]; j++); (v); };
v030588 = A030588list(up_to);
A030588(n) = v030588[n]; \\ Antti Karttunen, Dec 24 2018

(1 to 99 by 2).map(Integer.toString(, 6).toCharArray).flatten // _Alonso del Arte, Apr 02 2020

A030596 Length of n-th run of digit 1 in A030588.

Original entry on oeis.org

1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 7, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2

Offset: 1

Clark Kimberling

Antti Karttunen, Table of n, a(n) for n = 1..20000

Cf. A030588, A030597, A030598, A030599, A030600.

up_to = 20000;
A030596list(up_to,d=1) = { my(v=vector(up_to),ds=List([]),o=1,j=1,rl=0,i=0); while(i#ds,ds=digits(o,6);j=1;o+=2); if(d==ds[j],rl++,if(rl,i++; v[i] = rl; rl=0)); j++); (v); };
v030596 = A030596list(up_to);
A030596(n) = v030596[n]; \\ Antti Karttunen, Dec 24 2018

A030597 Length of n-th run of digit 2 in A030588.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 2, 2, 2

Offset: 1

Clark Kimberling

Antti Karttunen, Table of n, a(n) for n = 1..20000

Cf. A030588, A030596, A030598, A030599, A030600.

up_to = 20000;
A030597list(up_to,d=2) = { my(v=vector(up_to),ds=List([]),o=1,j=1,rl=0,i=0); while(i#ds,ds=digits(o,6);j=1;o+=2); if(d==ds[j],rl++,if(rl,i++; v[i] = rl; rl=0)); j++); (v); };
v030597 = A030597list(up_to);
A030597(n) = v030597[n]; \\ Antti Karttunen, Dec 24 2018

Terms corrected (first incorrect term was at a(61)) and more terms added by Antti Karttunen, Dec 24 2018

A030598 Length of n-th run of digit 3 in A030588.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 5, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Clark Kimberling

Antti Karttunen, Table of n, a(n) for n = 1..20000

Cf. A030588, A030596, A030597, A030599, A030600.

up_to = 20000;
A030598list(up_to,d=3) = { my(v=vector(up_to),ds=List([]),o=1,j=1,rl=0,i=0); while(i#ds,ds=digits(o,6);j=1;o+=2); if(d==ds[j],rl++,if(rl,i++; v[i] = rl; rl=0)); j++); (v); };
v030598 = A030598list(up_to);
A030598(n) = v030598[n]; \\ Antti Karttunen, Dec 24 2018

A030600 Length of the n-th run of digit 5 in A030588.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1

Offset: 1

Clark Kimberling

Antti Karttunen, Table of n, a(n) for n = 1..20000

Cf. A030588, A030596, A030597, A030598, A030599.

up_to = 20000;
A030600list(up_to,d=5) = { my(v=vector(up_to),ds=List([]),o=1,j=1,rl=0,i=0); while(i#ds,ds=digits(o,6);j=1;o+=2); if(d==ds[j],rl++,if(rl,i++; v[i] = rl; rl=0)); j++); (v); };
v030600 = A030600list(up_to);
A030600(n) = v030600[n]; \\ Antti Karttunen, Dec 24 2018

cp's OEIS Frontend

A030588 Write odd numbers in base 6 and juxtapose.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Scala

A030596 Length of n-th run of digit 1 in A030588.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A030597 Length of n-th run of digit 2 in A030588.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Extensions

A030598 Length of n-th run of digit 3 in A030588.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A030600 Length of the n-th run of digit 5 in A030588.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI