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.

A065023 Number of states in minimal automaton that recognizes biquanimous numbers in base n.

This page as a plain text file.
%I A065023 #22 Aug 08 2023 15:51:57
%S A065023 2,4,10,21,51,89,203,370,715,1197,2418,3813,7175,11379,19026,29809,
%T A065023 51618,75378,125951,185025,285449
%N A065023 Number of states in minimal automaton that recognizes biquanimous numbers in base n.
%C A065023 A biquanimous number (A064544) is a number whose digits can be split into two groups with equal sums.
%D A065023 Jeffrey Shallit, A Second Course in Formal Languages and Automata Theory, Cambridge, 2008; see Exercise 3.55.
%D A065023 William P. Thurston, personal communication.
%H A065023 Jingzhe Tang, <a href="https://ideone.com/zyzaFQ">C++ code calculating terms</a>
%Y A065023 Cf. A064544, A065024, A065025.
%K A065023 nonn,base,more
%O A065023 2,1
%A A065023 _N. J. A. Sloane_, Nov 03 2001
%E A065023 a(11)-a(16) from _Jingzhe Tang_, Mar 21 2018
%E A065023 a(17)-a(22) from _Sean A. Irvine_, Aug 08 2023