|
%I M0944 #39 Sep 03 2022 08:06:15
%S 1,2,4,5,6,7,9,10,12,13,14,15,17,18,20,22,23,25,26,27,28,30,31,33,34,
%T 35,36,38,39,40,41,43,44,46,47,48,49,51,52,54,56,57,59,60,61,62,64,65,
%U 67,68,69,70,72,73,75,77,78,80,81,82,83,85,86,88,89,90,91
%N Numbers k such that A003231(A001950(k)) = A001950(A003231(k)).
%C See 3.3 p. 344 in Carlitz link. - _Michel Marcus_, Feb 02 2014
%C This is the function named r in [Carlitz]. - _Eric M. Schmidt_, Aug 14 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.
%t a3221[n_] := Floor[n(5 + Sqrt[5])/2];
%t a1950[n_] := Floor[n(1 + Sqrt[5])^2/4];
%t Select[Range[100], a3221[a1950[#]] == a1950[a3221[#]]&] (* _Jean-François Alcover_, Aug 04 2018 *)
%o (PARI) A001950(n) = floor(n*(sqrt(5)+3)/2);
%o A003231(n) = floor(n*(sqrt(5)+5)/2);
%o lista(nn) = { for(n=1, nn, if (A003231(A001950(n)) == A001950(A003231(n)), print1(n, ", ")));} \\ _Michel Marcus_, Feb 02 2014
%o (Haskell)
%o a003233 n = a003233_list !! (n-1)
%o a003233_list = [x | x <- [1..],
%o a003231 (a001950 x) == a001950 (a003231 x)]
%o -- _Reinhard Zumkeller_, Oct 03 2014
%o (Python)
%o from math import isqrt
%o from itertools import count, islice
%o def A003233_gen(startvalue=1): # generator of terms >= startvalue
%o return filter(lambda n:((m:=(n+isqrt(5*n**2)>>1)+n)+isqrt(5*m**2)>>1)+(m<<1)==((k:=(n+isqrt(5*n**2)>>1)+(n<<1))+isqrt(5*k**2)>>1)+k,count(max(1,startvalue)))
%o A003233_list = list(islice(A003233_gen(),30)) # _Chai Wah Wu_, Sep 02 2022
%Y Cf. A001950, A003231, A003234.
%K nonn
%O 1,2
%A _N. J. A. Sloane_
%E More terms from _Michel Marcus_, Feb 02 2014
%E Definition from Michel Marcus moved from comment to name by _Eric M. Schmidt_, Aug 17 2014
|
