The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A214259 Number of compositions of n where the difference between largest and smallest parts equals one. 2

%I #19 Jan 10 2019 20:14:44

%S 0,0,2,3,9,11,25,35,60,96,157,241,401,637,1019,1639,2651,4258,6870,

%T 11075,17891,28895,46678,75412,121915,197109,318724,515414,833590,

%U 1348301,2181020,3528138,5707564,9233625,14938477,24168522,39102322,63264680,102358836

%N Number of compositions of n where the difference between largest and smallest parts equals one.

%H Alois P. Heinz, <a href="/A214259/b214259.txt">Table of n, a(n) for n = 1..4785</a>

%F a(n) = A072951(n) - A000005(n).

%F a(n) ~ phi^(n+1) / sqrt(5), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - _Vaclav Kotesovec_, Jan 07 2019

%e a(3) = 2: [2,1], [1,2].

%e a(4) = 3: [2,1,1], [1,2,1], [1,1,2].

%e a(5) = 9: [3,2], [2,3], [2,2,1], [2,1,2], [1,2,2], [2,1,1,1], [1,2,1,1], [1,1,2,1], [1,1,1,2].

%e a(6) = 11: [2,2,1,1], [2,1,2,1], [2,1,1,2], [1,2,2,1], [1,2,1,2], [1,1,2,2], [2,1,1,1,1], [1,2,1,1,1], [1,1,2,1,1], [1,1,1,2,1], [1,1,1,1,2].

%p with(numtheory):

%p a:= n-> add(binomial(t, n mod t), t=1..n) -tau(n):

%p seq(a(n), n=1..50);

%Y Column k=1 of A214258.

%Y Cf. A000005, A001622, A072951.

%K nonn

%O 1,3

%A _Alois P. Heinz_, Jul 08 2012

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 June 11 19:50 EDT 2024. Contains 373317 sequences. (Running on oeis4.)