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.

A290205 Group identifier of iterated Scrabble function.

This page as a plain text file.
%I A290205 #21 Apr 22 2023 10:28:52
%S A290205 4,4,4,4,4,4,4,4,4,4,4,4,12,4,4,4,4,12,12,4,12,4,12,12,4,12,12,12,4,4,
%T A290205 12,4,12,12,4,12,12,12,4,4,4,4,12,4,12,4,4,4,12,4,4,12,12,12,4,4,4,12,
%U A290205 12,12,4,12,4,12,12,12,12,12,4,4,4,4,4
%N A290205 Group identifier of iterated Scrabble function.
%C A290205 Take the sequence A113172.  Map it onto itself repeatedly.  You will either end up at the fixed point, 12, or a loop of 4->7->8->9->4 (here represented by 4).
%H A290205 Wikipedia, <a href="https://en.wikipedia.org/wiki/Scrabble">Scrabble</a>
%e A290205 For example 10, spelled TEN is worth 3 points, THREE is worth 8 points and 8 is in the 4/7/8/9 loop, so a(10)=4
%o A290205 (Python)
%o A290205 from num2words import num2words
%o A290205 def A290205(n):
%o A290205     f = lambda n:sum((1,3,3,2,1,4,2,4,1,8,5,1,3,1,1,3,10,1,1,1,1,4,4,8,4,10)[a] for d in num2words(n).replace(' and ','') if 0<=(a:=ord(d)-97)<=25)
%o A290205     while True:
%o A290205         n = f(n)
%o A290205         if n in {4,7,8,9,4}: return 4
%o A290205         if n == 12: return 12 # _Chai Wah Wu_, Apr 21 2023
%Y A290205 Cf. A113172.
%K A290205 nonn,word
%O A290205 0,1
%A A290205 _Michael Turniansky_, Jul 24 2017