|
%I #16 Mar 29 2020 09:32:24
%S 11,31,34,36,39,42,44,47,49,52,55,57,60,63,65,68,70,73,76,78,81,83,86,
%T 89,91,94,97,99,102,104,107,110,112,115,118,120,123,125,128,131,133,
%U 136,138,141,144,146,149,152,154,157,159,162,165,167,170,172,175,178,180
%N Kim-sums: "Kimberling sums" K_n + K_12.
%D Posting to math-fun mailing list Jan 10 1997.
%H J. H. Conway, Allan Wechsler, Marc LeBrun, Dan Hoey, N. J. A. Sloane, <a href="/A269725/a269725.txt">On Kimberling Sums and Para-Fibonacci Sequences</a>, Correspondence and Postings to Math-Fun Mailing List, Nov 1996 to Jan 1997
%p Ki := proc(n,i)
%p option remember;
%p local phi ;
%p phi := (1+sqrt(5))/2 ;
%p if i= 0 then
%p n;
%p elif i=1 then
%p floor((n+1)*phi) ;
%p else
%p procname(n,i-1)+procname(n,i-2) ;
%p end if;
%p end proc:
%p Kisum := proc(n,m)
%p local ks,a,i;
%p ks := [seq( Ki(n,i)+Ki(m,i),i=0..5)] ;
%p for i from 0 to 2 do
%p for a from 0 do
%p if Ki(a,0) = ks[i+1] and Ki(a,1) = ks[i+2] then
%p return a;
%p end if;
%p if Ki(a,0) > ks[i+1] then
%p break;
%p end if;
%p end do:
%p end do:
%p end proc:
%p A022423 := proc(n)
%p if n = 0 then
%p 11;
%p else
%p Kisum(n-1,11) ;
%p end if;
%p end proc:
%p seq(A022423(n),n=0..80) ; # _R. J. Mathar_, Sep 03 2016
%t Ki[n_, i_] := Ki[n, i] = Module[{phi = (1 + Sqrt[5])/2}, If[i == 0, n, If[i == 1, Floor[(n+1)*phi], Ki[n, i-1] + Ki[n, i-2]]]];
%t Kisum[n_, m_] := Module[{ks, a, i}, ks = Table[Ki[n, i] + Ki[m, i], {i, 0, 5}]; For[i = 0, i <= 2, i++, For[a = 0, True, a++, If[Ki[a, 0] == ks[[i+1]] && Ki[a, 1] == ks[[i+2]], Return[a]]; If[Ki[a, 0] > ks[[i+1]], Break[]]]]];
%t a[n_] := If[n == 0, 11, Kisum[n-1, 11]];
%t a /@ Range[0, 58] (* _Jean-François Alcover_, Mar 29 2020, after _R. J. Mathar_ *)
%Y The "Kim-sums" K_n + K_i for i = 2 through 12 are given in A022413, A022414, A022415, A022416, ..., A022423.
%K nonn
%O 0,1
%A _Marc LeBrun_
|
