cp's OEIS Frontend

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.

A242309 a(n) = A211384(2n)/A211384(n).

This page as a plain text file.
%I A242309 #14 Mar 27 2017 03:10:16
%S A242309 3,2,3,3,3,2,3,4,6,6,9,9,9,8,6,5,6,4,6,7,6,5,6,6,6,8,8,9,12,12,12,14,
%T A242309 13,12,15,18,18,12,18,20,21,20,21,21,21,20,21,20,21,24,24,20,27,26,27,
%U A242309 20,20,16,18,21,21,21,19,18,27,30,33,33,33,48,51,42
%N A242309 a(n) = A211384(2n)/A211384(n).
%H A242309 Alois P. Heinz, <a href="/A242309/b242309.txt">Table of n, a(n) for n = 1..10000</a>
%e A242309 a(11) = 9 because A211384(22) = 198 and A211384(11) = 22 and 198/22 = 9.
%p A242309 b:= proc(n) b(n):= `if`(n<3, 2*n-1, (h-> ceil((b(n-1)+1)/h)*h)
%p A242309     (ilcm(map(b, numtheory[divisors](n) minus {1, n})[]))) end:
%p A242309 a:= n-> b(2*n)/b(n):
%p A242309 seq(a(n), n=1..100);  # _Alois P. Heinz_, May 20 2014
%t A242309 b[1] = 1; b[2] = 3; b[n_] := b[n] = (Ceiling[(b[n-1]+1)/#]*#&)[LCM @@ Map[b, Most[Divisors[n]]]];
%t A242309 a[n_] := b[2n]/b[n];
%t A242309 Table[a[n], {n, 1, 80}] (* _Jean-François Alcover_, Mar 27 2017, after _Alois P. Heinz_ *)
%Y A242309 Cf. A211384.
%K A242309 nonn,look
%O A242309 1,1
%A A242309 _J. Lowell_, May 10 2014
%E A242309 More terms from _Alois P. Heinz_, May 10 2014