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.

Previous Showing 21-30 of 71 results. Next

A105085 Write the terms of A102370 in base 2, read by upward-sloping diagonals and convert to base 10.

Original entry on oeis.org

6, 7, 12, 13, 10, 11, 8, 9, 30, 31, 20, 21, 18, 19, 16, 17, 22, 23, 28, 29, 26, 27, 56, 57, 46, 47, 36, 37, 34, 35, 32, 33, 38, 39, 44, 45, 42, 43, 40, 41, 62, 63, 52, 53, 50, 51, 48, 49, 54, 55, 60, 61, 122, 123, 88, 89, 78, 79, 68, 69, 66, 67, 64, 65, 70, 71, 76, 77, 74, 75, 72
Offset: 0

Views

Author

N. J. A. Sloane, Apr 29 2005

Keywords

Comments

Read the central column of Table 1 of the paper, s(n), by upward-sloping diagonals. - R. J. Mathar, Aug 10 2007

Formula

a(2n) = 2*A102370(n+1), a(2n+1) = a(2n) + 1. - Philippe Deléham, Nov 11 2007

Extensions

Corrected and extended by R. J. Mathar, Aug 10 2007

A105228 a(n) = A102370(n) + 1.

Original entry on oeis.org

1, 4, 7, 6, 5, 16, 11, 10, 9, 12, 15, 14, 29, 24, 19, 18, 17, 20, 23, 22, 21, 32, 27, 26, 25, 28, 31, 62, 45, 40, 35, 34, 33, 36, 39, 38, 37, 48, 43, 42, 41, 44, 47, 46, 61, 56, 51, 50, 49, 52, 55, 54, 53, 64, 59, 58, 57, 60, 127, 94, 77, 72, 67, 66, 65, 68, 71, 70
Offset: 1

Views

Author

N. J. A. Sloane, Apr 15 2005

Keywords

Comments

If the array of negative numbers is written in 2's-complement notation and read by diagonals one obtains the sequence -1, -4, -7, -6, ...

Crossrefs

A158461 A102370(n) mod 3 .

Original entry on oeis.org

0, 0, 0, 2, 1, 0, 1, 0, 2, 2, 2, 1, 1, 2, 0, 2, 1, 1, 1, 0, 2, 1, 2, 1, 0, 0, 0, 1, 2, 0, 1, 0, 2, 2, 2, 1, 0, 2, 0, 2, 1, 1, 1, 0, 0, 1, 2, 1, 0, 0, 0, 2, 1, 0, 1, 0, 2, 2, 0, 0, 1, 2, 0, 2, 1, 1, 1, 0, 2, 1, 2, 1, 0, 0, 0, 2, 2, 0, 1, 0, 2, 2, 2, 1, 0, 2, 0, 2, 1, 1, 1, 2, 0, 1, 2, 1, 0, 0, 0, 2
Offset: 0

Views

Author

Philippe Deléham, Mar 19 2009

Keywords

A159059 a(n) = A102370(n) modulo 5.

Original entry on oeis.org

0, 3, 1, 0, 4, 0, 0, 4, 3, 1, 4, 3, 3, 3, 3, 2, 1, 4, 2, 1, 0, 1, 1, 0, 4, 2, 0, 1, 4, 4, 4, 3, 2, 0, 3, 2, 1, 2, 2, 1, 0, 3, 1, 0, 0, 0, 0, 4, 3, 1, 4, 3, 2, 3, 3, 2, 1, 4, 1, 3, 1, 1, 1, 0, 4, 2, 0, 4, 3, 4, 4, 3, 2, 0, 3, 2, 2, 2, 2, 1, 0, 3, 1, 0, 4, 0, 0, 4, 3, 1, 4, 0, 3, 3, 3, 2, 1, 4, 2, 1, 0, 1
Offset: 0

Views

Author

Philippe Deléham, Apr 04 2009

Keywords

Crossrefs

Cf. A102370.

Extensions

Missing a(14)=3 inserted by Georg Fischer, Mar 15 2024

A105104 Write A102370 in binary (A103542), read backwards, omit leading zeros, convert to base 10.

Original entry on oeis.org

0, 3, 3, 5, 1, 15, 5, 9, 1, 13, 7, 11, 7, 29, 9, 17, 1, 25, 13, 21, 5, 31, 11, 19, 3, 27, 15, 47, 13, 57, 17, 33, 1, 49, 25, 41, 9, 61, 21, 37, 5, 53, 29, 45, 15, 59, 19, 35, 3, 51, 27, 43, 11, 63, 23, 39, 7, 55, 63, 93, 25, 113, 33, 65, 1, 97, 49, 81, 17, 121, 41, 73
Offset: 0

Views

Author

N. J. A. Sloane, Apr 30 2005

Keywords

Comments

Similar to A102370, but read diagonals in reverse direction.

Crossrefs

Programs

  • PARI
    a1(n) = fromdigits(Vecrev(binary(n)), 2); \\ A030101
    a0(n) = if( n<1, 0, sum(k=0, length(binary(n)), bitand(n + k, 2^k))); \\ A102370
    a(n) = a1(a0(n)); \\ Michel Marcus, Apr 09 2022

Formula

a(n) = A030101(A102370(n)). - Philippe Deléham, Nov 11 2007

Extensions

More terms from Philippe Deléham, Nov 11 2007
a(46)=19 inserted and more terms from Georg Fischer, Apr 08 2022

A105109 a(n) defined by A103202(a(n)) = A102370(n).

Original entry on oeis.org

0, 1, 4, 3, 2, 11, 7, 6, 5, 8, 10, 9, 24, 19, 14, 13, 12, 15, 18, 17, 16, 26, 22, 21, 20, 23, 25, 56, 39, 34, 29, 28, 27, 30, 33, 32, 31, 42, 37, 36, 35, 38, 41, 40, 55, 50, 45, 44, 43, 46, 49, 48, 47, 57, 53, 52, 51, 54
Offset: 0

Views

Author

Philippe Deléham, Apr 30 2005

Keywords

Comments

A permutation of the nonnegative numbers.

Crossrefs

A105158 Table T(n,k), read by downward antidiagonals, defined by : T(0,0) = 0, T(n,n) = 2^n for n>0, T(n,k) - T(n,n) = A102371(n - k) if 0<= k < n, T(n,k) - T(n,n) = A102370(k - n) if k >= n.

Original entry on oeis.org

0, 3, 3, 6, 2, 6, 5, 5, 5, 15, 4, 8, 4, 28, 15, 7, 7, 9, 23, 61, 10, 6, 10, 8, 18, 44, 126, 9, 17, 9, 11, 17, 39, 93, 251, 8, 12, 8, 14, 16, 34, 76, 190, 504, 11, 11, 19, 13, 19, 33, 71, 157, 379, 1017, 14, 10, 14, 12, 22, 32, 66, 140, 318, 760, 2042, 13, 13, 13, 23, 21, 35, 65
Offset: 0

Views

Author

Philippe Deléham, May 01 2005

Keywords

Comments

Consider T(0,0) and the 2^n -1 first terms of the row n for n>0; this give A102370 : 0; 3; 6, 5, 4; 15, 10, 9, 8, 11, 14, 13; 28, 23, 18, 17, 16, 19, 22, 21, 20, 31, 26, 25, 24, 27, 30; ...

Examples

			Table T(n,k) begins:
0, 3, 6, 5, 4, 15, 10, 9, 8, 11, 14, 13, 28, ...
3, 2, 5, 8, 7, 6, 17, 12, 11, 10, 13, 16, 15, ...
6, 5, 4, 7, 10, 9, 8, 19, 14, 13, 12, 15, 18, ...
15, 10, 9, 8, 11, 14, 13, 12, 23, 18, 17, 16, 19, ...
28, 23, 18, 17, 16, 19, 22, 21, 20, 31, 26, 25, 24, ...
		

Crossrefs

Formula

T(0, k) = A102370(k); T(n, 0) = A103529(n+1).

A159057 a(n) = A102370(n) mod 10.

Original entry on oeis.org

0, 3, 6, 5, 4, 5, 0, 9, 8, 1, 4, 3, 8, 3, 8, 7, 6, 9, 2, 1, 0, 1, 6, 5, 4, 7, 0, 1, 4, 9, 4, 3, 2, 5, 8, 7, 6, 7, 2, 1, 0, 3, 6, 5, 0, 5, 0, 9, 8, 1, 4, 3, 2, 3, 8, 7, 6, 9, 6, 3, 6, 1, 6, 5, 4, 7, 0, 9, 8, 9, 4, 3, 2, 5, 8, 7, 2, 7, 2, 1, 0, 3, 6, 5, 4, 5, 0, 9, 8, 1, 4, 5, 8, 3, 8, 7, 6, 9, 2, 1, 0, 1, 6, 5, 4
Offset: 0

Views

Author

Philippe Deléham, Apr 04 2009

Keywords

Crossrefs

Cf. A102370.

A159058 A102370(n) modulo 8 .

Original entry on oeis.org

0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0, 3, 6, 5, 4, 7, 2, 1, 0
Offset: 0

Views

Author

Philippe Deléham, Apr 04 2009

Keywords

Comments

Simple periodic sequence .

Crossrefs

Programs

  • Mathematica
    PadRight[{},120,{0,3,6,5,4,7,2,1}] (* Harvey P. Dale, Mar 30 2025 *)

Formula

a(n)=a(n+8), a(0)=0, a(1)=3, a(2)=6, a(3)=5, a(4)=4, a(5)=7, a(6)=2, a(7)=1 .

A159060 A102370(n) modulo 6 .

Original entry on oeis.org

0, 3, 0, 5, 4, 3, 4, 3, 2, 5, 2, 1, 4, 5, 0, 5, 4, 1, 4, 3, 2, 1, 2, 1, 0, 3, 0, 1, 2, 3, 4, 3, 2, 5, 2, 1, 0, 5, 0, 5, 4, 1, 4, 3, 0, 1, 2, 1, 0, 3, 0, 5, 4, 3, 4, 3, 2, 5, 0, 3, 4, 5, 0, 5, 4, 1, 4, 3, 2, 1, 2, 1, 0, 3, 0, 5, 2, 3, 4, 3, 2, 5, 2, 1, 0, 5, 0, 5, 4, 1, 4, 5, 0, 1, 2, 1, 0, 3, 0, 5, 4, 3, 4, 3, 2
Offset: 0

Views

Author

Philippe Deléham, Apr 04 2009

Keywords

Previous Showing 21-30 of 71 results. Next