login

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”).

A164005
Zero together with row 5 of the array in A163280.
3
0, 7, 14, 21, 32, 45, 60, 77, 96, 117, 140, 165, 192, 221, 252, 285, 320, 357, 396, 437, 480, 525, 572, 621, 672, 725, 780, 837, 896, 957, 1020, 1085, 1152, 1221, 1292, 1365, 1440, 1517, 1596, 1677, 1760, 1845, 1932, 2021, 2112, 2205, 2300, 2397, 2496, 2597
OFFSET
0,2
FORMULA
Conjecture: a(n) = A100451(n+2). (See A163280.)
From G. C. Greubel, Aug 28 2017: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3), n >= 3.
a(n) = n*(n+4), n >= 3.
G.f.: x*(7 - 7*x + 4*x^3 - 2*x^4)/(1 - x)^3.
E.g.f.: x*(x+5)*exp(x) + 2*x + x^2. (End)
MAPLE
A033676 := proc(n) local a, d; a := 0 ; for d in numtheory[divisors](n) do if d^2 <= n then a := max(a, d) ; fi; od: a; end: A163280 := proc(n, k) local r, T ; r := 0 ; for T from k^2 by k do if A033676(T) = k then r := r+1 ; if r = n then RETURN(T) ; fi; fi; od: end: A164005 := proc(n) if n = 0 then 0; else A163280(5, n) ; fi; end: seq(A164005(n), n=0..80) ; # R. J. Mathar, Aug 09 2009
MATHEMATICA
Join[{0, 7, 14}, Table[n*(n + 4), {n, 3, 50}]] (* G. C. Greubel, Aug 28 2017 *)
PROG
(PARI) x='x+O('x^50); concat([0], Vec(x*(7 - 7*x + 4*x^3 - 2*x^4)/(1 - x)^3)) \\ G. C. Greubel, Aug 28 2017
KEYWORD
nonn,easy
AUTHOR
Omar E. Pol, Aug 08 2009
EXTENSIONS
Extended by R. J. Mathar, Aug 09 2009
STATUS
approved