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.

A331759 a(n) = A115004(2n+1).

This page as a plain text file.
%I A331759 #11 Aug 17 2021 02:17:49
%S A331759 1,31,179,585,1463,3065,5729,9797,15737,24087,35315,50073,69025,92871,
%T A331759 122475,158681,202529,254597,315957,387977,471589,568227,678971,
%U A331759 805241,948515,1109675,1290839,1493127,1717571,1966997,2242925,2547277,2881033,3246087,3645459
%N A331759 a(n) = A115004(2n+1).
%H A331759 Chai Wah Wu, <a href="/A331759/b331759.txt">Table of n, a(n) for n = 0..10000</a>
%H A331759 N. J. A. Sloane, <a href="/A115004/a115004.txt">Families of Essentially Identical Sequences</a>, Mar 24 2021 (Includes this sequence)
%F A331759 a(n) = (2*n+1)^2 + Sum_{i=2..2n+1} (2*n+2-i)*(4*n+4-i)*phi(i). - _Chai Wah Wu_, Aug 17 2021
%o A331759 (Python)
%o A331759 from sympy import totient
%o A331759 def A331759(n): return (2*n+1)**2 + sum(totient(i)*(2*n+2-i)*(4*n+4-i) for i in range(2,2*n+2)) # _Chai Wah Wu_, Aug 17 2021
%Y A331759 Cf. A115004, A331760.
%K A331759 nonn
%O A331759 0,2
%A A331759 _N. J. A. Sloane_, Feb 04 2020