|
%I #15 Aug 16 2022 03:05:57
%S 1,2,3,5,5,8,8,8,13,13,13,13,13,21,21,21,21,21,21,21,21,34,34,34,34,
%T 34,34,34,34,34,34,34,34,34,55,55,55,55,55,55,55,55,55,55,55,55,55,55,
%U 55,55,55,55,55,55,55,89,89,89,89,89,89,89,89,89,89,89,89
%N Least Fibonacci number not less than n.
%C This sequence plays a role in the definition of minimal alternating Fibonacci representations, introduced at A256655.
%C Essentially the same as A246104. - _R. J. Mathar_, Apr 14 2015
%H Clark Kimberling, <a href="/A256654/b256654.txt">Table of n, a(n) for n = 1..10000</a>
%F Concatenate these numbers: F(2), F(3), F(4), then F(3) F(5)'s, then F(4) F(6)'s, then F(5) F(7)'s, ... F(n+2) F(n)'s, ..., where F = A000045, the Fibonacci numbers.
%F Sum_{n>=1} 1/a(n)^2 = 1 + Sum_{n>=1} F(n)/F(n+2)^2 = 1.5651369873... . - _Amiram Eldar_, Aug 16 2022
%t h[0] = {1}; h[n_] := Join[h[n - 1], Table[Fibonacci[n + 2], {k, 1, Fibonacci[n]}]]; h[10]
%Y Cf. A000045, A087172, A246104, A256655.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Apr 08 2015
|
