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.

A292588 Compound filter: a(n) = P(A292582(n), A292583(n)), where P(n,k) is sequence A000027 used as a pairing function.

This page as a plain text file.
%I A292588 #7 Sep 26 2017 20:28:31
%S A292588 1,1,2,3,2,2,4,6,3,2,7,5,7,4,4,10,7,3,11,5,2,7,16,9,3,7,9,8,16,4,22,
%T A292588 15,4,7,7,21,22,11,11,9,22,2,29,12,5,16,37,14,3,3,11,12,37,9,4,13,7,
%U A292588 16,46,8,46,22,8,28,4,4,56,12,11,7,67,36,67,22,5,17,7,11,79,14,10,22,92,5,11,29,22,18,92,5,7,23,16,37,16,20,92,3,122,21,92,11
%N A292588 Compound filter: a(n) = P(A292582(n), A292583(n)), where P(n,k) is sequence A000027 used as a pairing function.
%C A292588 A filter constructed from the runlengths of numbers of the form 4k+0 and the runlengths of numbers of the form 4k+3 encountered in trajectories of A005940-tree.
%H A292588 Antti Karttunen, <a href="/A292588/b292588.txt">Table of n, a(n) for n = 1..16384</a>
%H A292588 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A292588 a(n) = (1/2)*(2 + ((A292582(n) + A292583(n))^2) - A292582(n) - 3*A292583(n)).
%Y A292588 Cf. A000027, A292582, A292583, A292584, A292587.
%K A292588 nonn
%O A292588 1,3
%A A292588 _Antti Karttunen_, Sep 26 2017