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.

A317837 a(n) = Sum_{d|n, d A002487(d).

This page as a plain text file.
%I A317837 #7 Aug 10 2018 09:06:14
%S A317837 0,1,1,2,1,4,1,3,3,5,1,7,1,5,6,4,1,10,1,9,6,7,1,10,4,7,7,9,1,16,1,5,8,
%T A317837 7,7,17,1,9,8,13,1,20,1,13,14,9,1,13,4,15,8,13,1,22,9,13,10,9,1,26,1,
%U A317837 7,18,6,9,22,1,13,10,23,1,24,1,13,17,17,9,26,1,17,15,13,1,34,9,15,10,19,1,40,9,17,8,11,11
%N A317837 a(n) = Sum_{d|n, d<n} A002487(d).
%H A317837 Antti Karttunen, <a href="/A317837/b317837.txt">Table of n, a(n) for n = 1..16384</a>
%H A317837 <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a>
%F A317837 a(n) = Sum_{d|n, d<n} A002487(d).
%F A317837 a(n) = A317838(n) - A002487(n).
%F A317837 a(n) = A001222(A293216(n)).
%o A317837 (PARI)
%o A317837 A002487(n) = { my(a=1, b=0); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (b); }; \\ From A002487
%o A317837 A317837(n) = sumdiv(n,d,(d<n)*A002487(d));
%Y A317837 Cf. A002487, A293216, A317838, A317839, A317840, A317841, A317843.
%K A317837 nonn
%O A317837 1,4
%A A317837 _Antti Karttunen_, Aug 09 2018