Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jun 18 2017 02:18:51
%S 16,23,163,184,464,499,919,968,1528,1591,2291,2368,3208,3299,4279,
%T 4384,5504,5623,6883,7016,8416,8563,10103,10264,11944,12119,13939,
%U 14128,16088,16291,18391,18608,20848,21079,23459,23704,26224,26483
%N Positive integers of the form (7*m^2+1)/11.
%C Here m=(11*(2*n-1)-9*(-1)^n)/4 for n>0.
%H B. Berselli, <a href="/A179370/b179370.txt">Table of n, a(n) for n = 1..10000</a>.
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-2,-1,1).
%F a(n) = (154*n*(n-1)-63*(2*n-1)*(-1)^n+65)/8.
%F G.f.: x*(16+7*x+108*x^2+7*x^3+16*x^4)/((1+x)^2*(1-x)^3).
%F a(n) = a(-n+1) = a(n-1)+2*a(n-2)-2*a(n-3)-a(n-4)+a(n-5).
%Y Cf. A113338, A179088, A179337, A179338, A179339.
%K nonn,easy
%O 1,1
%A _Bruno Berselli_, Jul 12 2010