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”).
G. C. Greubel, <a href="/A011906/b011906_1.txt">Table of n, a(n) for n = 1..650</a>
reviewed
approved
proposed
reviewed
editing
proposed
G. C. Greubel, <a href="/A011906/b011906_1.txt">Table of n, a(n) for n = 1..650</a>
G.f.: x*(-1+-23*x-+33*x^2+-3*x^3)/((x-1)*(-x^2)*(1-34*x+1x^2)*(1-6*x+x^2)).
a(n) = (1/16)*(1 - A029547(n) + 41*A091761(n) + 8*A001109(n)). - G. C. Greubel, Oct 18 2024
(Magma)
R<x>:=PowerSeriesRing(Integers(), 30); Coefficients(R!( x*(1-23*x+33*x^2-3*x^3)/((1-x)*(1-34*x+x^2)*(1-6*x+x^2)) )); // G. C. Greubel, Oct 18 2024
(SageMath)
def A011906_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P( x*(1-23*x+33*x^2-3*x^3)/((1-x)*(1-34*x+x^2)*(1-6*x+x^2)) ).list()
a=A011906_list(30); a[1:] # G. C. Greubel, Oct 18 2024
approved
editing
editing
approved
From R. J. Mathar, Apr 15 2010: (Start)
approved
editing
proposed
approved
editing
proposed
(TI-BASIC)
Clrio:Input "n", n:Lbl colorin:n+1(Sto)k:Lbl colorin2:
If (Sum)(n, n, n, k)=n*k Then Disp n:Disp k:Disp n*k:n+1(Sto)n:Goto colorin:
ElseIf n*k>(Sum)(n, n, n, k) Then:k+1(Sto)k:Goto colorin2:
ElseIf n*k<(Sum)(n, n, n, k) Then:n+1(Sto)n:Goto colorin:EndIf:EndPrgm
César Aguilera, Sep 16 2017
proposed
editing