|
%I #21 Aug 03 2016 03:40:50
%S 0,0,0,1,0,1,1,1,1,2,2,3,4,4,6,7,10,11,17,17,27,28,44,45,72,72,116,
%T 117,188,189,305,305,493,494,798,799,1292,1292,2090,2091,3382,3383,
%U 5473,5473,8855,8856,14328,14329,23184,23184,37512,37513,60696,60697,98209,98209,158905,158906,257114,257115,416020,416020
%N a(2k) = floor(F(k)/2), a(2k+1) = ceiling(F(k)/2), where F = A000045 is the Fibonacci sequence.
%C Original definition: Paired sequence: {male,female} ={Floor[A000045(n)/2],A000045[n]-Floor[A000045(n)/2]}
%C Shows excess of females over males in Fibonacci sequences.
%H Colin Barker, <a href="/A173673/b173673.txt">Table of n, a(n) for n = 0..1000</a>
%F a(2k) = floor(Fibonacci(k)/2), a(2k+1) = ceiling(Fibonacci(k)/2) = Fibonacci(k)-a(2k).
%F Empirical g.f.: x^3*(1+x+x^2+2*x^3+x^4+x^5) / ((1+x)*(1-x+x^2)*(1+x+x^2)*(1-x^2-x^4)). - _Colin Barker_, Aug 02 2016
%t Table[{Floor[Fibonacci[j]/
%t 2], Fibonacci[j] - Floor[Fibonacci[j]/2]}, {j, 0, 30}]
%t Flatten[%]
%o (PARI) a(n)=(fibonacci(n\2)+n%2)\2 \\ _M. F. Hasler_, Nov 24 2010
%Y Cf. A000045.
%K nonn
%O 0,10
%A _Roger L. Bagula_ and _Gary W. Adamson_, Nov 24 2010
|
