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.

A024377 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (primes).

This page as a plain text file.
%I A024377 #6 May 15 2025 17:19:54
%S A024377 2,3,5,7,16,20,35,43,53,65,86,106,137,153,196,220,246,270,329,353,412,
%T A024377 454,521,559,642,686,732,780,869,917,1032,1080,1199,1263,1388,1456,
%U A024377 1597,1673,1735,1823,1974,2062,2227,2301,2476,2572,2761,2863,3062,3166,3365,3475,3591
%N A024377 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (primes).
%Y A024377 Cf. A000040, A023532.
%K A024377 nonn
%O A024377 1,1
%A A024377 _Clark Kimberling_