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.

A344950 Numbers k such that #0's = #1's in the k-th word in A341258.

This page as a plain text file.
%I A344950 #5 Jun 11 2021 18:51:06
%S A344950 4,5,21,22,23,25,26,28,90,92,93,94,97,98,99,101,102,104,110,111,112,
%T A344950 114,115,117,122,123,125,130,380,383,385,386,387,391,393,394,395,398,
%U A344950 399,400,402,403,405,412,414,415,416,419,420,421,423,424,426,432,433
%N A344950 Numbers k such that #0's = #1's in the k-th word in A341258.
%C A344950 The sequences A344950, A344951, A344952 partition the positive integers. See A341258 for a guide to related sequences.
%e A344950 The first twenty words w(n):  0, 1, 00, 01, 10, 000, 11, 001, 010, 100, 0000, 011, 101, 0001, 110, 0010, 0100, 1000, 00000, 111; so a(1) = 4.
%t A344950 (See A341258.)
%Y A344950 Cf. A341258, A342910, A344951, A344952.
%K A344950 nonn,base
%O A344950 1,1
%A A344950 _Clark Kimberling_, Jun 07 2021