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-3 of 3 results.

A085186 Sequence A085195 shown in base 4.

Original entry on oeis.org

0, 1, 10, 11, 13, 100, 101, 110, 111, 113, 130, 131, 133, 203, 1000, 1001, 1010, 1011, 1013, 1100, 1101, 1110, 1111, 1113, 1130, 1131, 1133, 1203, 1300, 1301, 1310, 1311, 1313, 1330, 1331, 1333, 2003, 2030, 2031, 2033, 2103, 2123, 10000, 10001, 10010
Offset: 0

Views

Author

Antti Karttunen, Jun 14 2003

Keywords

Formula

a(n) = A007090(A085195(n)).

A085194 Terms of A085193 halved. The repeating part in the first differences of A057520.

Original entry on oeis.org

1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 29, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 13, 1, 3, 1, 2, 5, 1, 2, 4, 9, 1, 2, 4, 8, 101, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 29, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 13, 1, 3, 1, 2, 5, 1, 2, 4, 9, 1, 2, 4, 8, 37, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 13, 1, 3, 1, 2
Offset: 0

Views

Author

Antti Karttunen, Jun 14 2003

Keywords

Crossrefs

Partial sums: A085195. Records are given by A079319(n) = A085194(A000108(n+1)-1). Cf. A085189.

Formula

a(n) = A085193(n)/2.

A085188 Partial sums of A085189.

Original entry on oeis.org

0, 1, 3, 4, 7, 12, 13, 15, 16, 19, 27, 28, 31, 43, 60, 61, 63, 64, 67, 72, 73, 75, 76, 79, 87, 88, 91, 103, 132, 133, 135, 136, 139, 147, 148, 151, 163, 207, 208, 211, 223, 283, 360, 361, 363, 364, 367, 372, 373, 375, 376, 379, 387, 388, 391, 403, 420, 421, 423, 424
Offset: 0

Views

Author

Antti Karttunen, Jun 14 2003

Keywords

Crossrefs

Same sequence shown in factorial base: A085187. It seems that a(A000108(n)) = A001710(n). Cf. A085195.

Formula

a(0)=0, a(n) = a(n-1)+A085189(n-1).
Showing 1-3 of 3 results.