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.

A325102 Number of ordered pairs of positive integers up to n with no binary carries.

This page as a plain text file.
%I A325102 #5 Jul 27 2019 14:57:51
%S A325102 0,0,2,2,8,10,12,12,26,32,38,40,46,48,50,50,80,94,108,114,128,134,140,
%T A325102 142,156,162,168,170,176,178,180,180,242,272,302,316,346,360,374,380,
%U A325102 410,424,438,444,458,464,470,472,502,516,530,536,550,556,562,564,578
%N A325102 Number of ordered pairs of positive integers up to n with no binary carries.
%C A325102 A binary carry of two positive integers is an overlap of the positions of 1's in their reversed binary expansion.
%F A325102 a(n) = 2 * A325103(n).
%e A325102 The a(2) = 2 through a(6) = 12 pairs:
%e A325102   (1,2)  (1,2)  (1,2)  (1,2)  (1,2)  (1,2)
%e A325102   (2,1)  (2,1)  (1,4)  (1,4)  (1,4)  (1,4)
%e A325102                 (2,1)  (2,1)  (1,6)  (1,6)
%e A325102                 (2,4)  (2,4)  (2,1)  (2,1)
%e A325102                 (3,4)  (2,5)  (2,4)  (2,4)
%e A325102                 (4,1)  (3,4)  (2,5)  (2,5)
%e A325102                 (4,2)  (4,1)  (3,4)  (3,4)
%e A325102                 (4,3)  (4,2)  (4,1)  (4,1)
%e A325102                        (4,3)  (4,2)  (4,2)
%e A325102                        (5,2)  (4,3)  (4,3)
%e A325102                               (5,2)  (5,2)
%e A325102                               (6,1)  (6,1)
%t A325102 Table[Length[Select[Tuples[Range[n],2],Intersection[Position[Reverse[IntegerDigits[#[[1]],2]],1],Position[Reverse[IntegerDigits[#[[2]],2]],1]]=={}&]],{n,0,30}]
%Y A325102 Cf. A006218, A050315, A080572, A247935, A267610, A267700.
%Y A325102 Cf. A325094, A325096, A325098, A325103, A325104, A325106, A325108, A325123.
%K A325102 nonn
%O A325102 0,3
%A A325102 _Gus Wiseman_, Mar 28 2019