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 A120250 #15 Sep 13 2024 06:51:42
%S A120250 1,1,2,1,3,2,5,1,3,3,8,2,13,5,5,1,21,3,34,3,8,8,55,2,4,13,4,5,89,5,
%T A120250 144,1,13,21,7,3,233,34,21,3,377,8,610,8,7,55,987,2,7,4,34,13,1597,4,
%U A120250 11,5,55,89,2584,5,4181,144,11,1,18,13,6765,21,89,7,10946,3,17711,233,7,34
%N A120250 Denominator of cfenc(n) (see definition in comments).
%C A120250 a(n) := denominator of cfenc(n). cfenc(n) := number given by interpreting as a continued fraction expansion (indexed from 1) the sequence whose i-th entry is one plus the exponent on the i-th prime factor of n (fix cfenc(1)=1).
%H A120250 Hans Havermann, <a href="/A120250/b120250.txt">Table of n, a(n) for n = 1..10000</a>
%F A120250 a(2^k) = 1.
%F A120250 a(prime(n)) = Fibonacci(n+1).
%e A120250 a(2646) = denominator(cfenc(2646)) = denominator(cfenc(2^1 * 3^3 * 7^2)) = denominator(FromContinuedFraction[{2; 4, 1, 3}]) = denominator(2 + 1/(4 + 1/(1 + 1/3))) = denominator(42/19) = 19.
%t A120250 Table[If[n == 1, 1, (fl = FactorInteger[n]; pq = Table[1, {i, 1, PrimePi[Last[fl][[1]]]}]; While[Length[fl] > 0, pp = First[fl]; fl = Drop[fl, 1]; pq[[PrimePi[pp[[1]]]]] = pp[[2]] + 1;]; Denominator[FromContinuedFraction[pq]])],{n,1,80}]
%Y A120250 Corresponding numerators in A120249. Numerators modulo respective denominators in A120251.
%K A120250 frac,nonn,uned
%O A120250 1,3
%A A120250 Joseph Biberstine (jrbibers(AT)indiana.edu), Jun 12 2006