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 A328733 #35 May 24 2021 00:08:02 %S A328733 1,3,4,8,9,15,27,37,38,44,68,104,116,124,170,201,202,205,214,291,302, %T A328733 361,381,387,403,428,469,474,502,507,514,565,584,602,603,622,628,663, %U A328733 668,669,675,698,710,745,763,766,865,872,873,898,922,968,1006,1015,1018,1035,1075,1146,1153,1182 %N A328733 List of numbers k such that Fibonacci(k) and Fibonacci(k+1) have the same number of prime factors, counted with multiplicity. %C A328733 F(1) and F(2), both being 1, count as having zero prime factors each. %C A328733 0 is not a term since all primes divide 0. %C A328733 For the corresponding Fibonacci numbers, see A328734. %H A328733 Blair Kelly, <a href="http://mersennus.net/fibonacci/">Fibonacci factorizations up to 1000 terms</a> %H A328733 Tomás Roca Sánchez, <a href="https://github.com/greenlucid/oeis/blob/master/b02.py">Python script that uses already factorized numbers of the sequence</a> %e A328733 F(8) = 21 = 3 * 7, and F(9) = 34 = 2 * 17 have 2 prime factors each, so 8 is a part of the sequence. %o A328733 (Python) # See link %o A328733 (PARI) isok(k) = bigomega(fibonacci(k)) == bigomega(fibonacci(k+1)); \\ _Michel Marcus_, Nov 11 2019 %Y A328733 Cf. A000045, A038575, A328734. %K A328733 nonn %O A328733 1,2 %A A328733 _Tomás Roca Sánchez_, Oct 26 2019 %E A328733 More terms from _Amiram Eldar_, Oct 26 2019