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.

A364927 List of free polyplets in binary code (as defined in A246521), ordered first by number of bits, then by value of the binary code.

This page as a plain text file.
%I A364927 #18 Dec 07 2023 14:53:22
%S A364927 1,3,6,7,11,14,25,56,15,23,27,29,30,46,57,58,75,78,89,92,120,166,177,
%T A364927 178,198,209,240,390,452,960,31,47,59,62,79,91,93,94,110,121,122,124,
%U A364927 143,167,174,179,181,182,185,186,188,199,206,211,213,230,241,242
%N A364927 List of free polyplets in binary code (as defined in A246521), ordered first by number of bits, then by value of the binary code.
%C A364927 Can be read as an irregular triangle, whose n-th row contains A030222(n) terms.
%H A364927 Pontus von Brömssen, <a href="/A364927/b364927.txt">Table of n, a(n) for n = 1..22449</a> (rows 1..8).
%e A364927 As irregular triangle:
%e A364927   1;
%e A364927   3,  6;
%e A364927   7, 11, 14, 25, 56;
%e A364927   ...
%e A364927 The A030222(3) = 5 3-polyplets are oriented as follows to obtain their binary codes (see A246521):
%e A364927   . . .   . . .   . . .   . . .   5 . .
%e A364927   2 . .   . . .   2 . .   . 4 .   . 4 .
%e A364927   0 1 .   0 1 3   . 1 3   0 . 3   . . 3
%e A364927 This gives the binary codes 2^0+2^1+2^2 = 7, 2^0+2^1+2^3 = 11, 2^1+2^2+2^3 = 14, 2^0+2^3+2^4 = 25, and 2^3+2^4+2^5 = 56, respectively.
%Y A364927 Cf. A030222, A246521.
%K A364927 nonn,tabf
%O A364927 1,2
%A A364927 _Pontus von Brömssen_, Aug 13 2023