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.
%I A266194 #8 Dec 29 2015 03:26:22 %S A266194 2,6,12,20,30,48,56,63,90,120,192,176,187,221,416,448,252,360,380,627, %T A266194 495,510,748,1408,1344,504,864,1008,1820,1495,1518,1650,1000,1400, %U A266194 2520,3024,2016,1776,2516,1768,3328,3456,3483,3741,3770,3900,3960,4092,7936,9728,3040,3920,3577,4088,7616,5576,3936,6624,9936,9648,5628,8148,13289 %N A266194 Products of pairs made by match-making permutation: a(n) = A266195(n) * A266195(n+1). %H A266194 Antti Karttunen, <a href="/A266194/b266194.txt">Table of n, a(n) for n = 1..2693</a> %F A266194 a(n) = A266195(n) * A266195(n+1). %F A266194 a(n) = A048720(A266195(n), A266195(n+1)). %F A266194 a(n) = A057889(A057889(A266195(n)) * A057889(A266195(n+1))). [See the comment in A266351.] %o A266194 (Scheme, two variants) %o A266194 (define (A266194 n) (* (A266195 n) (A266195 (+ n 1)))) %o A266194 (define (A266194 n) (A048720bi (A266195 n) (A266195 (+ n 1)))) ;; A048720bi implements the carryless binary multiplication, specified in A048720. %Y A266194 Cf. A048720, A057889, A266195, A266351. %K A266194 nonn,base %O A266194 1,1 %A A266194 _Antti Karttunen_, Dec 26 2015