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 A224341 #9 Feb 20 2022 15:11:45
%S A224341 1,2,4,7,13,25,46,86,161,301,562,1051,1964,3670,6859,12819,23956,
%T A224341 44772,83673
%N A224341 Apparently solves the identity: Find sequence A that represents the numbers of ordered compositions of n into the elements of the set {B}; and vice versa.
%C A224341 Represents the numbers of ordered compositions of n using the terms of A224342: (1, 2, 3, 6, 10, 18, 32, ...); such that the latter represents the numbers of ordered compositions of n using the terms of A224341.
%C A224341 It appears that given any sequence of real terms pulled out of a hat S(n); repeated iterates of S(n) -> characteristic function of S(n) -> INVERT transform of the latter -> next sequence, (repeat); will converge upon two alternating sequences A224341 and A224342 as a fixed limit, as to absolute values.
%F A224341 The sequences are obtained by taking iterates as described in the comments. There is no known generating function at the date of this submission.
%e A224341 Given the sequence (1, 0, 0, 0, ...), a few iterates using the rules rapidly converge upon A224341 and A224342.
%Y A224341 Cf. A224342, A079958.
%K A224341 nonn
%O A224341 0,2
%A A224341 _Gary W. Adamson_, Apr 03 2013