This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A247431 #21 Jan 05 2025 19:51:40 %S A247431 1,2,3,5,6,8,9,10,12,13,14,16,17,19,20,21,23,24,25,27,28,30,31,32,34, %T A247431 35,37,38,39,41,42,43,45,46,48,49,50,52,53,55,56,57,59,60,61,63,64,66, %U A247431 67,68,70,71,72,74,75,77,78,79,81,82,84,85,86,88,89,90,92 %N A247431 The largest integer m such that A001950(m) < A003231(n). %C A247431 This is the function named K in [Carlitz]. %H A247431 L. Carlitz, R. Scoville, and T. Vaughan, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/11-4/carlitz.pdf">Some arithmetic functions related to Fibonacci numbers</a>, Fib. Quart., 11 (1973), 337-386. %o A247431 (PARI) a31(n) = (5*n+sqrtint(5*n^2))\2; \\ A003231 %o A247431 a50(n) = (sqrtint(n^2*5)+n*3)\2; \\ A001950 %o A247431 a(n) = my(m=1, N=a31(n)); while(a50(m) < N, m++); m-1; \\ _Michel Marcus_, Nov 14 2023 %Y A247431 Cf. A001950, A003231. %K A247431 nonn %O A247431 1,2 %A A247431 _Eric M. Schmidt_, Sep 17 2014