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 A136610 #15 Jun 07 2025 11:57:07 %S A136610 0,1,1,0,1,1,0,2,1,1,2,1,1,2,3,1,2,4,1,2,2,2,5,2,1,3,5,3,5,3,1,3,4,4, %T A136610 3,3,5,5,4,3,6,5,4,5,5,7,7,7,4,5,4,5,6,9,5,6,8,6,7,4,6,7,8,7,7,9,7,7, %U A136610 5,7,10,8,6,10,8,9,6,10,8,6,6 %N A136610 Number of odd digits in Fibonacci numbers. %H A136610 Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibtable.html">The Fibonacci numbers</a>. %F A136610 a(n) = A196564(A000045(n)). - _Michel Marcus_, May 06 2025 %F A136610 a(n) = A060384(n) - A138468(n). - _James C. McMahon_, Jun 07 2025 %e A136610 1597 = Fibonacci(17) and has four odd digits, so a(17) = 4. %p A136610 nodss := proc(n) local dgs,d; dgs := convert(n,base,10) ; add( d mod 2, d=dgs) ; end: A136610 :=proc(n) nodss(combinat[fibonacci](n)) ; end: seq( A136610(n),n=0..80) ; # _R. J. Mathar_, Jul 08 2009 %t A136610 a[n_]:=Total[Boole[OddQ/@IntegerDigits[Fibonacci[n]]]] (* _James C. McMahon_, May 06 2025 *) %Y A136610 Cf. A000045, A138468, A196564. %Y A136610 Cf. A060384, A085855. - _R. J. Mathar_, Jul 08 2009 %K A136610 nonn,base %O A136610 0,8 %A A136610 _Parthasarathy Nambi_, May 11 2008 %E A136610 a(13) corrected and more terms added by _R. J. Mathar_, Jul 08 2009