login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022422 Kim-sums: "Kimberling sums" K_n + K_11. 1

%I #7 Sep 03 2016 09:04:47

%S 10,28,31,12,36,39,41,44,17,49,52,54,57,60,62,65,25,70,73,75,78,30,83,

%T 86,33,91,94,96,99,38,104,107,109,112,115,117,120,46,125,128,130,133,

%U 51,138,141,143,146,149,151,154,59,159,162,164,167,64,172,175,67

%N Kim-sums: "Kimberling sums" K_n + K_11.

%D Posting to math-fun mailing list Jan 10 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 A022422 := proc(n)

%p if n = 0 then

%p 10;

%p else

%p Kisum(n-1,10) ;

%p end if;

%p end proc:

%p seq(A022422(n),n=0..80) ; # _R. J. Mathar_, Sep 03 2016

%K nonn

%O 0,1

%A _Marc LeBrun_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 11:45 EDT 2024. Contains 371278 sequences. (Running on oeis4.)