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.

A111241 a(n) = A109735(n)/A109890(n+1).

This page as a plain text file.
%I A111241 #15 Apr 26 2024 14:32:15
%S A111241 1,1,3,2,2,4,9,5,4,3,5,5,9,5,4,8,15,8,12,27,52,7,4,2,5,3,6,106,14,5,9,
%T A111241 5,4,6,107,180,21,362,121,183,176,69,59,150,28,151,232,19,10,2,11,9,
%U A111241 233,360,247,304,155,244,195,98,231,174,196,50,591,296,198,51,199
%N A111241 a(n) = A109735(n)/A109890(n+1).
%C A111241 This is always an integer for n>=2.
%C A111241 a(n) = 1 for n in A111315. When this happens A109890(n+1) makes a large jump. The corresponding values of A109890(n+1) are in A111316 (cf. A111242).
%H A111241 Michael De Vlieger, <a href="/A111241/b111241.txt">Table of n, a(n) for n = 2..10000</a>
%F A111241 a(n) = A094340(n) for all n > 1. - _David Wasserman_, Jan 06 2009
%e A111241 A109735(4)=12, A109890(5)=4, so a(4) = 12/4 = 3.
%t A111241 nn = 71; c[_] := False;
%t A111241 Array[Set[{a[#], c[#]}, {#, True}] &, 2]; s = a[1] + a[2];
%t A111241 Reap[Do[k = SelectFirst[Divisors[s], ! c[#] &];
%t A111241     c[k] = True; Sow[s/k];
%t A111241 s += k, {n, 3, nn}] ][[-1, 1]] (* _Michael De Vlieger_, Apr 26 2024 *)
%Y A111241 Cf. A109735, A109890, A094340, A111315, A111316, A111242.
%Y A111241 Different from A094339.
%K A111241 nonn
%O A111241 2,3
%A A111241 _N. J. A. Sloane_, Oct 30 2005