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.

A327489 T(n, k) = 1 + NOR(k - 1, n - k), where NOR is the Peirce arrow operating bitwise on the inputs, triangle read by rows, T(n, k) for n >= 1, 1 <= k <= n.

Original entry on oeis.org

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

Views

Author

Peter Luschny, Sep 22 2019

Keywords

Examples

			                               1
                              1, 1
                            2, 1, 2
                           1, 1, 1, 1
                         4, 1, 2, 1, 4
                        3, 3, 1, 1, 3, 3
                      2, 3, 2, 1, 2, 3, 2
                     1, 1, 1, 1, 1, 1, 1, 1
                   8, 1, 2, 1, 4, 1, 2, 1, 8
                  7, 7, 1, 1, 3, 3, 1, 1, 7, 7
                6, 7, 6, 1, 2, 3, 2, 1, 6, 7, 6
               5, 5, 5, 5, 1, 1, 1, 1, 5, 5, 5, 5
             4, 5, 6, 5, 4, 1, 2, 1, 4, 5, 6, 5, 4
            3, 3, 5, 5, 3, 3, 1, 1, 3, 3, 5, 5, 3, 3
          2, 3, 2, 5, 2, 3, 2, 1, 2, 3, 2, 5, 2, 3, 2
         1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Crossrefs

Cf. A327488 (Nand), A327490 (Iff), A280172 (Xor).
T(2n+1,n+1) gives A080079.

Programs

  • Maple
    A327489 := (n, k) -> 1 + Bits:-Nor(k-1, n-k):
seq(seq(A327489(n, k), k=1..n), n=1..12);

A327490 T(n, k) = 1 + IFF(k - 1, n - k), where IFF is Boolean equality evaluated bitwise on the inputs, triangle read by rows, T(n, k) for n >= 1, 1 <= k <= n.

Original entry on oeis.org

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

Views

Author

Peter Luschny, Sep 22 2019

Keywords

Comments

If row(n) has, seen as a set, only one element k then k is either 1 or 1 + 2^n and n has the form 2^n or 3*2^n.

Examples

			                               1
                              1, 1
                            2, 2, 2
                           1, 1, 1, 1
                         4, 2, 4, 2, 4
                        3, 3, 3, 3, 3, 3
                      2, 4, 2, 4, 2, 4, 2
                     1, 1, 1, 1, 1, 1, 1, 1
                   8, 2, 4, 2, 8, 2, 4, 2, 8
                  7, 7, 3, 3, 7, 7, 3, 3, 7, 7
                6, 8, 6, 4, 6, 8, 6, 4, 6, 8, 6
               5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5

Crossrefs

Cf. A327488 (Nand), A327489 (Nor), A280172 (Xor).

Programs

  • Maple
    A327490 := (n, k) -> 1 + Bits:-Iff(k-1, n-k):
seq(seq(A327490(n, k), k=1..n), n=1..12);

A327488 T(n, k) = 1 + NAND(k - 1, n - k), where NAND is the Sheffer stroke operating bitwise on the inputs, triangle read by rows, T(n, k) for n >= 1, 1 <= k <= n.

Original entry on oeis.org

1, 2, 2, 4, 1, 4, 4, 4, 4, 4, 8, 3, 2, 3, 8, 8, 8, 2, 2, 8, 8, 8, 7, 8, 1, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 16, 7, 6, 7, 4, 7, 6, 7, 16, 16, 16, 6, 6, 4, 4, 6, 6, 16, 16, 16, 15, 16, 5, 4, 3, 4, 5, 16, 15, 16, 16, 16, 16, 16, 4, 4, 4, 4, 16, 16, 16, 16
Offset: 1

Views

Author

Peter Luschny, Sep 22 2019

Keywords

Examples

			                               1
                              2, 2
                            4, 1, 4
                           4, 4, 4, 4
                         8, 3, 2, 3, 8
                        8, 8, 2, 2, 8, 8
                      8, 7, 8, 1, 8, 7, 8
                     8, 8, 8, 8, 8, 8, 8, 8
                  16, 7, 6, 7, 4, 7, 6, 7, 16
                16, 16, 6, 6, 4, 4, 6, 6, 16, 16
             16, 15, 16, 5, 4, 3, 4, 5, 16, 15, 16
           16, 16, 16, 16, 4, 4, 4, 4, 16, 16, 16, 16
        16, 15, 14, 15, 16, 3, 2, 3, 16, 15, 14, 15, 16
      16, 16, 14, 14, 16, 16, 2, 2, 16, 16, 14, 14, 16, 16
   16, 15, 16, 13, 16, 15, 16, 1, 16, 15, 16, 13, 16, 15, 16
16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16

Crossrefs

Cf. A327489 (Nor), A327490 (Iff), A280172 (Xor).

Programs

  • Maple
    A327488 := (n, k) -> 1 + Bits:-Nand(k-1, n-k):
seq(seq(A327488(n, k), k=1..n), n=1..12);
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.