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.

A317944 a(n) = Product_{d|n, d>1} prime(A286378(d)-1).

This page as a plain text file.
%I A317944 #5 Aug 12 2018 21:25:56
%S A317944 1,2,3,4,5,18,7,8,33,50,13,108,17,98,285,16,23,2178,29,500,651,338,37,
%T A317944 648,185,578,1353,1372,43,162450,47,32,2067,1058,2065,143748,61,1682,
%U A317944 3417,5000,71,847602,73,8788,247665,2738,83,3888,581,68450,6141,19652,97,3661218,6565,19208,8961,3698,107,92596500,109,4418,809193,64
%N A317944 a(n) = Product_{d|n, d>1} prime(A286378(d)-1).
%H A317944 Antti Karttunen, <a href="/A317944/b317944.txt">Table of n, a(n) for n = 1..8192</a>
%H A317944 <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a>
%F A317944 a(n) = Product_{d|n, d>1} A008578(A286378(d)).
%F A317944 For all k >= 0, a(2^k) = 2^k.
%o A317944 (PARI)
%o A317944 \\ Needs also code from A286378:
%o A317944 A317944(n) = { my(m=1); fordiv(n,d, if(d>1, m *= prime(A286378(d)-1))); (m); };
%Y A317944 Cf. A286378, A317942, A317945 (restricted growth sequence transform).
%Y A317944 Cf. also A305794.
%K A317944 nonn
%O A317944 1,2
%A A317944 _Antti Karttunen_, Aug 12 2018