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.

User: Bartlomiej Malarz

Bartlomiej Malarz's wiki page.

Bartlomiej Malarz has authored 2 sequences.

A350027 Years in which Easter falls on the same day and month in both the Julian and Gregorian calendars, starting with 1583.

Original entry on oeis.org

1583, 1585, 1588, 1591, 1594, 1597, 1600, 1601, 1604, 1605, 1607, 1608, 1611, 1612, 1615, 1618, 1621, 1624, 1627, 1628, 1629, 1631, 1632, 1634, 1635, 1638, 1639, 1642, 1645, 1648, 1649, 1651, 1654, 1656, 1658, 1659, 1662, 1665, 1666, 1668, 1669, 1672, 1675
Offset: 1

Views

Author

Bartlomiej Malarz, Dec 22 2021

Keywords

Comments

The Gregorian calendar was introduced in October 1582 by Pope Gregory XIII.

Links

Crossrefs

Cf. A060958, A104019, A104034.

A350131 Number of segments lit to display the number n on a 9-segment display used by the Russian postal service.

Original entry on oeis.org

6, 3, 4, 4, 4, 5, 5, 3, 7, 5, 9, 6, 7, 7, 7, 8, 8, 6, 10, 8, 10, 7, 8, 8, 8, 9, 9, 7, 11, 9, 10, 7, 8, 8, 8, 9, 9, 7, 11, 9, 10, 7, 8, 8, 8, 9, 9, 7, 11, 9, 11, 8, 9, 9, 9, 10, 10, 8, 12, 10, 11, 8, 9, 9, 9, 10, 10, 8, 12, 10, 9, 6, 7, 7, 7, 8, 8, 6, 10, 8
Offset: 0

Views

Author

Bartlomiej Malarz, Dec 16 2021

Keywords

Examples

			The Russian postal service uses a special template for entering postal codes, which makes automatic sorting of their parcels faster. It has nine segments, and digits looks like this (please check the first link in the Links section for a more readable, graphical example):
._       _   _         _        _   _    _
| |  /|   |  /_  |_|  |_   /_   /  |_|  |_|
|_|   |  /_   /    |   _|  |_|  |  |_|   /
The template for a single digit contains nine segments: four vertical, three horizontal and two diagonal:
Vertical      Horizontal      Diagonal
                   _
   | |             _              /
   | |             _              /
Using a combination of vertical, horizontal and/or diagonal segments, it is possible to create digits:
.
                  number of segments
         =====================================
  digit  total  vertical  horizontal  diagonal
  -----  -----  --------  ----------  --------
    0      6        4          2          0
    1      3        2          0          1
    2      4        1          2          1
    3      4        0          2          2
    4      4        3          1          0
    5      5        2          3          0
    6      5        2          2          1
    7      3        1          1          1
    8      7        4          3          0
    9      5        2          2          1

Links

Crossrefs

Cf. A006942, A010371, A063720, A074458.
Cf. A350177 (histogram).

Programs

  • Mathematica
    Table[Total[IntegerDigits[n]/.{0->6, 1->3, 2->4, 3->4, 6->5, 7->3, 8->7, 9->5}], {n, 0, 79}] (* Stefano Spezia, Dec 17 2021 *)
  • PHP
     $segments[$n], str_split($i)));
    echo $usedSegments . "\n";
} // Simplified by Bartlomiej Malarz, Oct 30 2024
  • Python
    segments = [6, 3, 4, 4, 4, 5, 5, 3, 7, 5]
def a(n): return sum(segments[int(d)] for d in str(n))
print([a(n) for n in range(80)]) # Michael S. Branicky, Dec 22 2021

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

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