|
|
|
|
#48 by N. J. A. Sloane at Wed Jan 05 15:26:28 EST 2022
|
|
|
|
#47 by Michael S. Branicky at Wed Dec 22 21:12:55 EST 2021
|
|
|
|
#46 by Michael S. Branicky at Wed Dec 22 21:12:50 EST 2021
|
| PROG
|
(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
|
| STATUS
|
proposed
editing
|
|
|
|
#45 by Stefano Spezia at Sat Dec 18 16:10:36 EST 2021
|
|
|
|
#44 by Stefano Spezia at Sat Dec 18 16:10:17 EST 2021
|
| CROSSREFS
|
Cf. A350177 (histogram).
|
| STATUS
|
proposed
editing
|
|
|
|
#43 by Michel Marcus at Sat Dec 18 05:49:06 EST 2021
|
|
|
|
#42 by Michel Marcus at Sat Dec 18 05:48:41 EST 2021
|
| KEYWORD
|
nonn,base,changed
|
| STATUS
|
proposed
editing
|
|
|
Discussion
|
Sat Dec 18
| 05:49
| Michel Marcus: kwd base since we are writing integers in base 10
|
|
|
|
#41 by Stefano Spezia at Fri Dec 17 14:28:42 EST 2021
|
|
|
Discussion
|
Fri Dec 17
| 17:26
| Bartlomiej Malarz: Yes, the table is ok, thank you.
|
|
|
|
#40 by Stefano Spezia at Fri Dec 17 14:28:31 EST 2021
|
| 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 *)
|
| STATUS
|
proposed
editing
|
|
|
|
#39 by Jon E. Schoenfield at Fri Dec 17 10:57:42 EST 2021
|
|
|
Discussion
|
Fri Dec 17
| 11:00
| Jon E. Schoenfield: I noticed that no two digits have the same set of segment counts except for the pair {6, 9} (not surprising given the rotational symmetry).
|
|
|
|