cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 15 results. Next

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

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    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

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    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

Extensions

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

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    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

A030599 Length of n-th run of digit 4 in A030588.

Original entry on oeis.org

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, 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
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    up_to = 20000;
    A030599list(up_to,d=4) = { 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); };
    v030599 = A030599list(up_to);
    A030599(n) = v030599[n]; \\ Antti Karttunen, Dec 24 2018

Extensions

Terms corrected by 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

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    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

A030589 Position of n-th 0 in A030588.

Original entry on oeis.org

35, 38, 41, 89, 92, 95, 143, 146, 149, 197, 200, 203, 251, 254, 257, 305, 306, 309, 310, 313, 314, 317, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 378, 382, 386, 450, 454, 458, 522, 526, 530, 594, 598
Offset: 1

Views

Author

Keywords

A030590 Position of n-th 1 in A030588.

Original entry on oeis.org

1, 4, 5, 6, 8, 11, 17, 23, 29, 34, 36, 37, 40, 43, 44, 45, 46, 47, 49, 50, 52, 54, 55, 58, 61, 63, 64, 67, 70, 72, 73, 76, 79, 81, 82, 85, 90, 98, 99, 101, 104, 108, 117, 126, 135, 144, 152, 153, 155, 158, 162, 171, 180, 189, 198, 206, 207
Offset: 1

Views

Author

Keywords

A030591 Position of n-th 2 in A030588.

Original entry on oeis.org

10, 12, 14, 53, 56, 59, 88, 91, 94, 97, 100, 103, 106, 107, 109, 110, 112, 113, 115, 118, 121, 124, 127, 130, 133, 136, 139, 161, 164, 167, 215, 218, 221, 269, 272, 275, 330, 334, 338, 402, 406, 410, 449, 453, 457, 461, 465, 469
Offset: 1

Views

Author

Keywords

A030592 Position of n-th 3 in A030588.

Original entry on oeis.org

2, 7, 13, 16, 18, 19, 20, 25, 31, 39, 48, 57, 62, 65, 66, 68, 75, 84, 93, 102, 111, 116, 119, 120, 122, 129, 138, 142, 145, 147, 148, 151, 154, 156, 157, 160, 163, 165, 166, 169, 170, 172, 173, 174, 175, 176, 178, 181, 183, 184, 187
Offset: 1

Views

Author

Keywords

Programs

  • Mathematica
    Flatten[Position[Flatten[Table[IntegerDigits[2n-1,6],{n,70}]],3]] (* Harvey P. Dale, Jul 22 2012 *)

A030593 Position of n-th 4 in A030588.

Original entry on oeis.org

22, 24, 26, 71, 74, 77, 125, 128, 131, 179, 182, 185, 196, 199, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 233, 235, 236, 238, 239, 241, 244, 247, 287, 290, 293, 354, 358, 362, 426, 430, 434, 498, 502, 506, 570, 574
Offset: 1

Views

Author

Keywords

Programs

  • Mathematica
    Position[Flatten[Table[IntegerDigits[2n-1,6],{n,200}]],4]//Flatten (* Harvey P. Dale, Feb 05 2023 *)
Showing 1-10 of 15 results. Next