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

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

Links

Bartlomiej Malarz, Table of n, a(n) for n = 0..99999

Wikipedia, Postal code template.

Wikipedia, Postal codes in Russia.

Example

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

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 *)

Prog

(PHP)
<?php
$segments = [6, 3, 4, 4, 4, 5, 5, 3, 7, 5];
$maxvalue = 100;
for ($i = 0; $i <= $maxvalue; $i++) {
    $usedSegments = array_sum(array_map(fn($n) => $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

Crossrefs

Cf. A006942, A010371, A063720, A074458.

Cf. A350177 (histogram).

Sequence in context: A309988 A275835 A257235 * A167052 A222230 A365066

Adjacent sequences: A350128 A350129 A350130 * A350132 A350133 A350134

Keyword

nonn,base,changed

Author

Bartlomiej Malarz, Dec 16 2021

Status

approved