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.

Showing 1-3 of 3 results.

A066105 Indices of the maximum increasing subsequences of A066848 and A066849.

Original entry on oeis.org

1, 2, 3, 4, 9, 10, 13, 16, 27, 35, 39, 40, 44, 55, 56, 63, 66
Offset: 0

Views

Author

David Applegate, May 14 2002

Keywords

Comments

In other words, a_k is the smallest denominator that is not covered by the time a_{k-1} is covered. This sequence is finite if there is a denominator that is never covered.

A066720 The greedy rational packing sequence: a(1) = 1; for n > 1, a(n) is smallest number such that the ratios a(i)/a(j) for 1 <= i < j <= n are all distinct.

Original entry on oeis.org

1, 2, 3, 5, 7, 8, 11, 13, 17, 18, 19, 23, 29, 31, 37, 41, 43, 47, 50, 53, 59, 60, 61, 67, 71, 73, 79, 81, 83, 89, 97, 98, 101, 103, 105, 107, 109, 113, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239
Offset: 1

Views

Author

N. J. A. Sloane, Jan 15 2002

Keywords

Comments

Sequence was apparently invented by Jeromino Wannhoff - see the Rosenthal link.
An equivalent definition: a(1) = 1, a(2) = 2 and thereafter a(n) is the smallest number such that all a(i)*a(j) are different. - Thanks to Jean-Paul Delahaye for this comment. - N. J. A. Sloane, Oct 01 2020
If you replace the word "ratio" with "difference" and start from 1 using the same greedy algorithm you get A005282. - Sharon Sela (sharonsela(AT)hotmail.com), Jan 15 2002
Taking a(n) as the smallest number such that the pairwise sums a(i)+a(j) (iA011185. - Jean-Paul Delahaye, Oct 02 2020. [This replaces an incorrect comment.]
Does every rational number appear as a ratio? See A066657, A066658.
Contains all primes. Differs from A066724 in that the latter forbids only the products of distinct terms. - Ivan Neretin, Mar 02 2016

Examples

			After 5, 7 is the next member and not 6 as 6*1 = 2*3.
		

Crossrefs

Consists of the primes together with A066721.
For the rationals that are produced see A066657/A066658 and A066848, A066849.

Programs

  • Haskell
    import qualified Data.Set as Set (null)
    import Data.Set as Set (empty, insert, member)
    a066720 n = a066720_list !! (n-1)
    a066720_list = f [] 1 empty where
       f ps z s | Set.null s' = f ps (z + 1) s
                | otherwise   = z : f (z:ps) (z + 1) s'
         where s' = g (z:ps) s
               g []     s                      = s
               g (x:qs) s | (z * x) `member` s = empty
                          | otherwise          = g qs $ insert (z * x) s
    -- Reinhard Zumkeller, Nov 19 2013
  • Maple
    A[1]:= 1:
    F:= {1}:
    for n from 2 to 100 do
    for k from A[n-1]+1 do
    Fk:= {k^2, seq(A[i]*k,i=1..n-1)};
    if Fk intersect F = {} then
    A[n]:= k;
    F:= F union Fk;
    break
    fi
    od
    od:
    seq(A[i],i=1..100); # Robert Israel, Mar 02 2016
  • Mathematica
    s={1}; xok := Module[{}, For[i=1, i<=n, i++, For[j=1; k=Length[dl=Divisors[s[[i]]x]], j<=k, j++; k--, If[MemberQ[s, dl[[j]]]&&MemberQ[s, dl[[k]]], Return[False]]]]; True]; For[n=1, True, n++, Print[s[[n]]]; For[x=s[[n]]+1, True, x++, If[xok, AppendTo[s, x]; Break[]]]] (* Dean Hickerson *)
    a[1] = 1; a[n_] := a[n] = Block[{k = a[n - 1] + 1, b = c = Table[a[i], {i, 1, n - 1}], d}, While[c = Append[b, k]; Length[ Union[ Flatten[ Table[ c[[i]]/c[[j]], {i, 1, n}, {j, 1, n}]]]] != n^2 - n + 1, k++ ]; Return[k]]; Table[ a[n], {n, 1, 75} ] (* Robert G. Wilson v *)
    nmax = 100; a[1] = 1; F = {1};
    For[n = 2, n <= nmax, n++,
    For[k = a[n-1]+1, True, k++, Fk = Join[{k^2}, Table[a[i]*k, {i, 1, n-1}]] // Union; If[Fk ~Intersection~ F == {}, a[n] = k; F = F ~Union~ Fk; Break[]
    ]]];
    Array[a, nmax] (* Jean-François Alcover, Mar 26 2019, after Robert Israel *)
  • PARI
    {a066720(m) = local(a,rat,n,s,new,b,i,k,j); a=[]; rat=Set([]); n=0; s=0; while(sKlaus Brockhaus, Feb 23 2002
    

Extensions

More terms from Dean Hickerson, Klaus Brockhaus and David Applegate, Jan 15 2002
Entry revised by N. J. A. Sloane, Oct 01 2020.

A066848 Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of k; set a(n) = -1 if some fraction i/n never appears.

Original entry on oeis.org

1, 2, 3, 2436, 520, 60, 308, 2436, 15867, 61800, 8096, 55620, 77077, 20216, 51675, 2296992, 21607, 15867, 185820, 481680, 140805, 226644, 145866, 1568928, 1076000, 187772, 5596587, 1831956, 715778, 3540060, 836535, 2296992, 3088008, 1129514, 7096775, 1995048, 2018646, 3159168, 13019136, 15293320, 6936667, 11250624, 6877463, 20475136, 3380040, 3986360, 1052424, 17566608, 5152350, 1076000, 3824694, 8897564, 2987239, 17600004, 24056230, 89537336, 23397531, 2791424, 5393780, 19344660, 5306268, 8679008, 126415359, 30486400, 29303235
Offset: 1

Views

Author

N. J. A. Sloane, Jan 21 2002

Keywords

Examples

			3/4 does not occur until we reach A066720(401) = 2436 and then we see A066720(320)/A066720(401) = 1827/2436 = 3/4. Therefore a(4) = 2436.
		

Crossrefs

Cf. A066720, A066657, A066658. A066849 gives values of m.

Extensions

Corrected by John W. Layman, Feb 05 2002
Greatly extended by David Applegate, Feb 13 2002
Showing 1-3 of 3 results.