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 #13 Mar 30 2024 05:03:45
%S 1,3,8,15,21,32,40,55,72,84,105,128,144,171,189,220,253,275,312,336,
%T 377,420,448,495,544,576,629,663,720,779,817,880,945,987,1056,1100,
%U 1173,1248,1296,1375,1425,1508,1593,1647,1736,1827,1885,1980,2040,2139,2240
%N Main diagonal of A101646.
%p with(combinat) : A014417 := proc(n) local a,i,nredu,j; i := 1 ; while fibonacci(i) <= n do i := i+1 ; od ; nredu := n ; a := [seq(0,j=1..i-1)] ; while i >= 2 do if fibonacci(i) <= nredu then nredu := nredu-fibonacci(i) ; a := subsop(i=1,a) ; fi ; i := i-1 ; od ; RETURN(a) ; end: A101646 := proc(n,k) local a,nZeck,kZeck,i,j ; a := 0 ; nZeck := A014417(n) ; kZeck := A014417(k) ; for i from 2 to nops(nZeck) do for j from 2 to nops(kZeck) do a := a+op(i,nZeck)*op(j,kZeck)*fibonacci(i+j-2) ; od: od: RETURN(a) ; end: A101711 := proc(n) A101646(n,n) ; end: seq(A101711(n),n=1..80) ; # _R. J. Mathar_, Aug 07 2007
%t a[n_] := n^2 - Floor[(n+1)/GoldenRatio^2]^2;
%t Table[a[n], {n, 1, 80}] (* _Jean-François Alcover_, Mar 30 2024, after _Fred Lunnon_ in A101646 *)
%K nonn
%O 1,2
%A _David Applegate_ and _N. J. A. Sloane_, Jan 26 2005
%E More terms from _R. J. Mathar_, Aug 07 2007