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.

A324378 a(n) = A000265(1+A005187(n)).

This page as a plain text file.
%I A324378 #6 Feb 28 2019 18:53:31
%S A324378 1,1,1,5,1,9,11,3,1,17,19,5,23,3,13,27,1,33,35,9,39,5,21,43,47,3,25,
%T A324378 51,27,55,57,29,1,65,67,17,71,9,37,75,79,5,41,83,43,87,89,45,95,3,49,
%U A324378 99,51,103,105,53,55,111,113,57,117,59,15,121,1,129,131,33,135,17,69,139,143,9,73,147,75,151,153,77,159,5,81
%N A324378 a(n) = A000265(1+A005187(n)).
%H A324378 Antti Karttunen, <a href="/A324378/b324378.txt">Table of n, a(n) for n = 0..16384</a>
%H A324378 Antti Karttunen, <a href="/A324378/a324378.txt">Data supplement: n, a(n) computed for n = 0..65537</a>
%H A324378 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A324378 a(n) = A000265(1+A005187(n)).
%F A324378 A002487(a(n)) = A324288(n).
%F A324378 a(2^n) = 1 for all n >= 0.
%o A324378 (PARI)
%o A324378 A000265(n) = (n/2^valuation(n, 2));
%o A324378 A005187(n) = { my(s=n); while(n>>=1, s+=n); s; };
%o A324378 A324378(n) = A000265(1+A005187(n));
%Y A324378 Cf. A000265, A002487, A005187, A324288, A324377.
%K A324378 nonn
%O A324378 0,4
%A A324378 _Antti Karttunen_, Feb 28 2019