|
%I M4079 #14 Jul 06 2015 06:20:52
%S 1,6,9,22,40,43,48,56,61,64,111,145,150,153,166,255,273,276,281,289,
%T 294,297,310,315,318,323,328,331,336,344,378,383,386,399,417,420,425,
%U 433,438,441,488,721,755,760,763,776,865,988,993,996,1009,1027,1030,1035
%N Related to representations as sums of Fibonacci numbers.
%C Numbers such that A003231(n) = A003234(n), see Table 1 p. 357 in Carlitz link. - _Michel Marcus_, Feb 02 2014
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H L. Carlitz, R. Scoville and T. Vaughan, <a href="http://www.fq.math.ca/Scanned/11-4/carlitz.pdf">Some arithmetic functions related to Fibonacci numbers</a>, Fib. Quart., 11 (1973), 337-386.
%o (PARI) A001950(n) = floor(n*(sqrt(5)+3)/2); \\ b
%o A003231(n) = floor(n*(sqrt(5)+5)/2); \\ c
%o iss(n) = A003231(A001950(n)) == A001950(A003231(n)) - 1;
%o lista(nn) = {v003231 = vector(nn, i, floor(i*(sqrt(5)+5)/2)); v003234 = select(n->iss(n), vector(5*nn, i, i)); for (n=1, nn, if (v003231[n] == v003234[n], print1(n, ", ")););} \\ _Michel Marcus_, Feb 02 2014
%K nonn
%O 1,2
%A _N. J. A. Sloane_.
%E More terms from _Michel Marcus_, Feb 02 2014
|
