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.

A270004 Run-length encoding of iterated Scrabble function.

This page as a plain text file.
%I A270004 #53 Dec 01 2021 05:17:38
%S A270004 12,1,4,2,1,1,1,2,1,3,2,1,1,2,1,3,4,1,1,1,3,1,2,3,3,3,1,1,1,5,6,3,1,2,
%T A270004 4,3,1,2,1,1,1,1,3,2,2,1,1,5,2,1,1,3,2,7,1,4,1,4,1,4,1,1,1,1,1,3,1,2,
%U A270004 1,4,2,1,1,4,1,1,8,2,2,3,3,2,2,3,1,3,3,2,1,1,2,2,2,3,1,2,3,7,1,1,5,3,1,1,6
%N A270004 Run-length encoding of iterated Scrabble function.
%C A270004 Number of identical consecutive integers in A290205.
%H A270004 Michael Turniansky, <a href="/A270004/b270004.txt">Table of n, a(n) for n = 0..455</a>
%H A270004 Wikipedia, <a href="http://en.wikipedia.org/wiki/Scrabble">Scrabble</a>
%o A270004 (Python)
%o A270004 from num2words import num2words
%o A270004 tp = {"aeilnorstu": 1, "dg": 2, "bcmp":3, "fhvwy":4, "k":5, "jx":8, "qz":10}
%o A270004 def pts(c): return ([tp[s] for s in tp if c in s]+[0])[0]
%o A270004 def A113172(n): return sum(map(pts, num2words(n).replace(" and", "")))
%o A270004 def A290205(n):
%o A270004     while n not in {12, 4, 7, 8, 9}: n = A113172(n)
%o A270004     return 12 if n == 12 else 4
%o A270004 def aupton(terms):
%o A270004     alst, prev, k, rl = [], A290205(0), 1, 1
%o A270004     while len(alst) < terms:
%o A270004         while A290205(k) == prev: k += 1; rl += 1
%o A270004         alst.append(rl); rl = 0; prev = 12 if prev == 4 else 4
%o A270004     return alst
%o A270004 print(aupton(105)) # _Michael S. Branicky_, Dec 01 2021
%Y A270004 Cf. A113172, A290205.
%K A270004 nonn,word
%O A270004 0,1
%A A270004 _Michael Turniansky_, Jul 24 2017