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.

Previous Showing 21-23 of 23 results.

A326776 a(n) is the smallest divisor of the n-th nonprime number (A018252(n)) not already in the sequence.

Original entry on oeis.org

1, 2, 3, 4, 9, 5, 6, 7, 15, 8, 18, 10, 21, 11, 12, 25, 13, 27, 14, 30, 16, 33, 17, 35, 36, 19, 39, 20, 42, 22, 45, 23, 24, 49, 50, 51, 26, 54, 55, 28, 57, 29, 60, 31, 63, 32, 65, 66, 34, 69, 70, 72, 37, 75, 38, 77, 78, 40, 81, 41, 84, 85, 43, 87, 44, 90, 91
Offset: 1

Views

Author

Rémy Sigrist, Jul 28 2019

Keywords

Comments

This sequence is a permutation of the natural numbers.
Empirically:
- the subsequence with the terms satisfying a(n) <= n correspond to A093641,
- if a(n) > n, then a(n) = A018252(n),
- these two situations appear as two lines in the scatterplot of the sequence.

Examples

			The first terms, alongside the divisors of A018252(n), are:
  n   a(n)  div(A018252(n))
  --  ----  ---------------
   1     1  (1)
   2     2  (1, 2, 4)
   3     3  (1, 2, 3, 6)
   4     4  (1, 2, 4, 8)
   5     9  (1, 3, 9)
   6     5  (1, 2, 5, 10)
   7     6  (1, 2, 3, 4, 6, 12)
   8     7  (1, 2, 7, 14)
   9    15  (1, 3, 5, 15)
  10     8  (1, 2, 4, 8, 16)
		

Crossrefs

Programs

  • PARI
    See Links section.

A309389 a(n) is the smallest positive divisor not yet in the sequence of 11*A000217(n-1); n >= 1.

Original entry on oeis.org

1, 11, 3, 2, 5, 15, 7, 4, 6, 9, 55, 22, 13, 77, 21, 8, 17, 33, 19, 10, 14, 121, 23, 12, 20, 25, 27, 18, 29, 87, 31, 16, 24, 51, 35, 30, 37, 209, 39, 26, 41, 123, 43, 86, 45, 69, 47, 44, 28, 49, 75, 34, 53, 99, 135, 70, 38, 57, 59, 66, 61, 341, 63, 32, 40, 65, 67, 134, 46, 105, 71, 36, 73, 407, 111
Offset: 1

Views

Author

Enrique Navarrete, Jul 27 2019

Keywords

Comments

Up to n=10000, 1176 of the first 1228 odd primes appear as fixed points of a(n), i.e., 95.8%.
Conjecture: for large p prime, the odd primes (except p) appear as fixed points of b(n), where b(n) is the smallest positive divisor not yet in the sequence of p*A000217(n-1); n >= 1 (see link).

Examples

			For n = 1: a(1) = 1 is the smallest divisor of 11*0 not yet in the sequence.
For n = 23: a(23) = 23 is a fixed point and the smallest divisor of 11*253 not yet in the sequence.
For n = 73: a(73) = 73 is a fixed point and the smallest divisor of 11*2628 not yet in the sequence.
		

Crossrefs

A320672 a(n) is the smallest divisor of (n+2)*(n+3) not yet in the sequence.

Original entry on oeis.org

1, 2, 4, 3, 6, 7, 8, 5, 10, 11, 12, 13, 14, 15, 16, 9, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 17, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 33, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 44, 56, 57, 58, 59, 60, 61, 62, 63, 64, 55, 66, 67, 68, 69, 70
Offset: 0

Views

Author

Enrique Navarrete, Oct 19 2018

Keywords

Comments

a(n) is the smallest divisor of A002378(n+2) not yet in the sequence.
The numbers that are smaller than the preceding terms are: 3, 5, 9, 17, 33, 44, 55, 65, 90, 99, 143, 208, ...

Examples

			For n = 0, a(0) = 1 since 1 is the smallest divisor of 6 not yet in the sequence.
For n = 3, a(3) = 3 since 3 is the smallest divisor of 30 not yet in the sequence.
		

Crossrefs

Programs

  • Mathematica
    s = {}; Do[d = Divisors[(n + 2)(n + 3)]; Do[d1 = d[[k]]; If[FreeQ[s, d1], AppendTo[s, d1]; Break[]], {k, Length[d]}], {n, 0, 100}]; s (* Amiram Eldar, Nov 14 2018 *)
  • PARI
    toadd(n, v) = {fordiv(n, d, if (!vecsearch(v, d), return(d)); ); }
    lista(nn) = {v = []; for (n = 0, nn, newt = toadd((n+2)*(n+3), v); print1(newt, ", "); v = vecsort(concat(v, newt)); ); } \\ Michel Marcus, Nov 20 2018
Previous Showing 21-23 of 23 results.