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

A082222
a(n) = (n-th partial sum of A082219)/n = (n-th partial sum of the first row of array A082218)/n.
5
1, 2, 2, 4, 7, 10, 12, 14, 17, 18, 21, 26, 30, 34, 40, 45, 51, 55, 62, 66, 72, 74, 82, 89, 98, 104, 112, 122, 134, 143, 153, 160, 170, 183, 193, 200, 214, 227, 242, 251, 264, 275, 287, 298, 312, 327, 342, 359, 372, 384, 399, 411, 429, 444, 463, 477, 485, 502, 510
OFFSET
1,2
EXAMPLE
From Petros Hadjicostas, Feb 25 2021: (Start)
a(1) = A082219(1)/1 = 1/1 = 1.
a(2) = (A082219(1) + A082219(2))/2 = (1 + 3)/2 = 2.
a(3) = (A082219(1) + A082219(2) + A082219(3)) = (1 + 3 + 2)/3 = 2.
a(4) = (A082219(1) + ... + A082219(4))/4 = (1 + 3 + 2 + 10)/4 = 4. (End)
PROG
(PARI) lista(nn) = { my(a=matrix(nn, nn)); my(b=vector(nn)); my(d=vector(nn)); S=Set(); for(s=2, nn+1, if(s%2, i0=1; i1=s-1; i2=1, i0=s-1; i1=1; i2=-1);
forstep(i=i0, i1, i2, j=s-i; ii=sum(k=1, j-1, a[i, k]); jj=sum(k=1, i-1, a[k, j]);
c=chinese(Mod(ii, j), Mod(jj, i));
t=component(c, 1)-lift(c); while(setsearch(S, t), t+=component(c, 1));
a[i, j]=t; S=setunion(S, [t]); b[j] = sum(k=1, j, a[1, j])/j); ); d[1]=b[1]; for(kk=1, nn, d[kk]=sum(ss=1, kk, b[ss])/kk); d; } \\ This is a modification of Max Alekseyev's PARI program from A082219.
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 09 2003
EXTENSIONS
More terms from Max Alekseyev, Jun 08 2007
Edited by N. J. A. Sloane, Jun 11 2007
Name edited by Petros Hadjicostas, Feb 25 2021
STATUS
approved