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.

A175489 a(n) = Sum_{k=1..n} b(k,n), where b(k,n) is the largest positive integer that, when written in binary, occurs as a substring in both binary k and binary n.

This page as a plain text file.
%I A175489 #16 Feb 05 2020 15:01:49
%S A175489 1,3,5,8,11,16,17,21,26,28,39,46,55,58,51,54,63,65,85,87,82,104,118,
%T A175489 128,144,147,163,176,193,181,141,137,154,156,192,162,212,231,252,247,
%U A175489 275,202,267,307,306,333,336,345,373,381,410,412,419,423,475,497,532,539
%N A175489 a(n) = Sum_{k=1..n} b(k,n), where b(k,n) is the largest positive integer that, when written in binary, occurs as a substring in both binary k and binary n.
%C A175489 Row sums of A175488. - _R. J. Mathar_, Sep 28 2010
%H A175489 Rémy Sigrist, <a href="/A175489/b175489.txt">Table of n, a(n) for n = 1..8192</a>
%H A175489 Rémy Sigrist, <a href="/A175489/a175489.gp.txt">PARI program for A175489</a>
%p A175489 A175488 := proc(n,m) for a from m to 1 by -1 do abin := convert(a,base,2) ; nbin := convert(n,base,2) ; mbin := convert(m,base,2) ; if verify(abin,nbin,'sublist') and verify(abin,mbin,'sublist') then return a; end if; end do: end proc:
%p A175489 A175489 := proc(n) add(A175488(n,m),m=1..n) ; end proc:
%p A175489 seq(A175489(n),n=1..50) ;
%p A175489 # _R. J. Mathar_, Sep 28 2010
%o A175489 (PARI) See Links section.
%Y A175489 Cf. A175488, A175490.
%K A175489 base,nonn,look
%O A175489 1,2
%A A175489 _Leroy Quet_, May 28 2010
%E A175489 More terms from _R. J. Mathar_, Sep 28 2010