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 11-20 of 47 results. Next

A249817 Permutation of natural numbers: a(1) = 1, a(n) = A083221(A055396(n),A246277(n)).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 27, 22, 23, 24, 25, 26, 21, 28, 29, 30, 31, 32, 39, 34, 35, 36, 37, 38, 63, 40, 41, 42, 43, 44, 33, 46, 47, 48, 49, 50, 75, 52, 53, 54, 65, 56, 99, 58, 59, 60, 61, 62, 57, 64, 95, 66, 67, 68, 111, 70, 71, 72, 73, 74, 51, 76, 77, 78, 79, 80, 45, 82, 83, 84, 155, 86, 135
Offset: 1

Views

Author

Antti Karttunen, Nov 06 2014

Keywords

Comments

a(n) tells which number in square array A083221 (the sieve of Eratosthenes) is at the same position where n is in array A246278. As both arrays have even numbers as their topmost row and primes as their leftmost column, both sequences are among the fixed points of this permutation.
Equally: a(n) tells which number in array A083140 is at the same position where n is in the array A246279, as they are the transposes of above two arrays.

Crossrefs

Inverse: A249818.
There are three different "deep" versions of this permutation, recursing on values of A055396(n) and/or A246277(n), namely: A250245, A250247 and A250249.
Other similar or related permutations: A249815.
Differs from its inverse A249818 for the first time at n=33, where a(33) = 39, while A249818(33) = 45.

Programs

  • Mathematica
    lim = 87; a083221 = Table[Take[Prime[n] Select[Range[Ceiling[lim/2]^2], GCD[# Prime@ n, Product[Prime@ i, {i, 1, n - 1}]] == 1 &], Ceiling[lim/2]], {n, Ceiling[lim/2]}]; a055396[n_] PrimePi[FactorInteger[n][[1, 1]]]; a246277[n_] := Which[n == 1, 0, EvenQ@ n, n/2, True, a246277[Times @@ Power[Which[# == 1, 1, # == 2, 1, True, NextPrime[#, -1]] & /@ First@ Transpose@ FactorInteger@ n, Last@ Transpose@ FactorInteger@ n]]]; Table[a083221[[a055396@ n, a246277@ n]], {n, 2, lim}] (* Michael De Vlieger, Jan 04 2016, after Jean-François Alcover at A055396 and Yasutoshi Kohmoto at A083140 *)
  • Scheme
    (define (A249817 n) (if (= 1 n) n (A083221bi (A055396 n) (A246277 n)))) ;; Code for A083221bi given in A083221
    ;; Alternative version:
    (define (A249817 n) (if (= 1 n) n (A083221bi (A055396 n) (A249821bi (A055396 n) (A078898 n))))) ;; Code for A249821bi given in A249821.

Formula

a(1) = 1, a(n) = A083221(A055396(n), A246277(n)).
a(1) = 1, a(n) = A083221(A055396(n), A249821(A055396(n), A078898(n))).
As a composition of other permutations:
a(1) = 1, and for n > 1, a(n) = 1 + A249815(n-1).
Other identities. For all n >= 1:
a(A005843(n)) = A005843(n) and a(A000040(n)) = A000040(n). [Fixes even numbers and primes, among other numbers. Cf. comments above].
A020639(a(n)) = A020639(n) and A055396(a(n)) = A055396(n). [Preserves the smallest prime factor of n].

A250470 a(n) = A249817(A064989(A249818(n))).

Original entry on oeis.org

1, 1, 2, 1, 3, 2, 5, 1, 4, 3, 7, 2, 11, 5, 6, 1, 13, 4, 17, 3, 8, 7, 19, 2, 9, 11, 10, 5, 23, 6, 29, 1, 12, 13, 15, 4, 31, 17, 14, 3, 37, 10, 41, 7, 16, 19, 43, 2, 25, 9, 18, 11, 47, 8, 21, 5, 20, 23, 53, 6, 59, 29, 22, 1, 27, 14, 61, 13, 24, 15, 67, 4, 71, 31, 26, 17, 35, 22, 73, 3, 28, 37, 79, 10, 33, 41, 30, 7, 83, 12, 55, 19, 32, 43, 39, 2, 89, 25, 34, 9, 97, 26, 101
Offset: 1

Views

Author

Antti Karttunen, Dec 06 2014

Keywords

Comments

Odd bisection, A250472, is a permutation of natural numbers. A250479 gives the even bisection.
For odd numbers n >= 3, a(n) = A078898(n)-th number k for which A055396(k) = A055396(n)-1. In other words, a(n) tells which number is located immediately above n in the sieve of Eratosthenes (see A083140, A083221) in the same column of the sieve that contains n.

Crossrefs

Odd bisection: A250472.
Even bisection: A250479.
Differs from A064989 for the first time at n=21, where a(21) = 8, while
A064989(21) = 10.

Programs

Formula

a(n) = A249817(A064989(A249818(n))).
Other identities. For all n >= 1:
a(A250469(n)) = n. [This is an inverse function for injection A250469.]
For all odd numbers n >= 3: A055396(a(n)) = A055396(n)-1.

A249821 Square array of permutations: A(row,col) = A246277(A083221(row,col)), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ... .

Original entry on oeis.org

1, 2, 1, 3, 2, 1, 4, 3, 2, 1, 5, 5, 3, 2, 1, 6, 4, 5, 3, 2, 1, 7, 7, 7, 5, 3, 2, 1, 8, 11, 11, 7, 5, 3, 2, 1, 9, 6, 13, 11, 7, 5, 3, 2, 1, 10, 13, 17, 13, 11, 7, 5, 3, 2, 1, 11, 17, 4, 17, 13, 11, 7, 5, 3, 2, 1, 12, 10, 19, 19, 17, 13, 11, 7, 5, 3, 2, 1, 13, 19, 23, 23, 19, 17, 13, 11, 7, 5, 3, 2, 1, 14, 9, 6, 29, 23, 19, 17, 13, 11, 7, 5, 3, 2, 1, 15, 8, 29, 31, 29, 23, 19, 17, 13, 11, 7, 5, 3, 2, 1
Offset: 1

Views

Author

Antti Karttunen, Nov 06 2014

Keywords

Comments

Permutation A249817 preserves the smallest prime factor of n, i.e., A055396(A249817(n)) = A055396(n), in other words, keeps all the terms that appear on any row of A246278 on the same row of A083221. Permutations in this table are induced by changes that A249817 does onto each row of the latter table, thus permutation on row r of this table can be used to sort row r of A246278 into ascending order. I.e., A246278(r, A(r,c)) = A083221(r,c) [the corresponding row in the Sieve of Eratosthenes, where each row appears in monotone order].
The multi-set of cycle-sizes of permutation A249817 is a disjoint union of cycle-sizes of all permutations in this array. For example, A249817 has a 7-cycle (33 39 63 57 99 81 45) which originates from the 7-cycle (6 7 11 10 17 14 8) of A064216, which occurs as the second row in this table.
On each row, 4 is the first composite number (and the first term less than previous, apart from row 1), and on row n it occurs in position A250474(n). This follows because A001222(A246277(n)) = A001222(n)-1 and because on each row of A083221 (see A083140) all terms between the square of prime (second term on each row) and the first cube (of the same prime, this cube mapping in this array to 4) are nonsquare semiprimes (A006881), this implies that the corresponding terms in this array must be primes.
Also, as the smaller prime factor of the terms on row n of A083221 is constant, A020639(n), and for all i < j: A246277(p_{i} * p_{j}) < A246277(p_i * p_{j+1}), the primes on any row appear in monotone order.

Examples

			The top left corner of the array:
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, ...
1, 2, 3, 5, 4,  7, 11,  6, 13, 17, 10, 19,  9,  8, 23, 29, 14, 15, 31, ...
1, 2, 3, 5, 7, 11, 13, 17,  4, 19, 23,  6, 29, 31, 37, 41,  9, 43, 10, ...
1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37,  4, 41, 43, 47, 53, 59, ...
...
		

Crossrefs

Inverse permutations can be found from table A249822.
Row k+1 is a left-to-right composition of the first k rows of A251721.
Row 1: A000027 (an identity permutation), Row 2: A064216, Row 3: A249823, Row 4: A249825.
The initial growing part of each row converges towards A008578.

Programs

Formula

A(row,col) = A246277(A083221(row,col)).
A001222(A(row,col)) = A001222(A083221(row,col)) - 1. [This follows directly from the properties of A246277.]

A138511 Semiprimes where the larger prime factor is greater than the square of the smaller prime factor, short: semiprimes p*q, p^2 < q.

Original entry on oeis.org

10, 14, 22, 26, 33, 34, 38, 39, 46, 51, 57, 58, 62, 69, 74, 82, 86, 87, 93, 94, 106, 111, 118, 122, 123, 129, 134, 141, 142, 145, 146, 155, 158, 159, 166, 177, 178, 183, 185, 194, 201, 202, 205, 206, 213, 214, 215, 218, 219, 226, 235, 237, 249, 254, 262, 265, 267, 274, 278, 291, 295, 298, 302, 303, 305
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 21 2008

Keywords

Comments

From Antti Karttunen, Dec 17 2014, further edited Jan 01 & 04 2014: (Start)
Semiprimes p*q, p < q, such that the smallest r for which r^k <= p and q < r^(k+1) [for some k >= 0] is q+1, and thus k = 0. In other words, semiprimes whose both prime factors do not fit (simultaneously) between any two consecutive powers of any natural number r less than or equal to the larger prime factor. This condition forces the larger prime factor q to be greater than the square of the smaller prime factor because otherwise the opposite condition given in A251728 would hold.
Assuming that A054272(n), the number of primes in interval [prime(n), prime(n)^2], is nondecreasing (implied for example if Legendre's or Brocard's conjecture is true), these are also "unsettled" semiprimes that occur in a square array A083221 constructed from the sieve of Eratosthenes, "above the line A251719", meaning that if and only if row < A251719(col) then a semiprime occurring at A083221(row, col) is in this sequence, and conversely, all the semiprimes that occur at any position A083221(row, col) where row >= A251719(col) are in the complementary sequence A251728.
(End)
Semiprimes p*q, p < q, such that b = q+1 is the minimal base with the property that p and q have equal length representations in base b. This was the original definition, which is based primarily on A138510: A138510(A174956(a(n))) = A084127(A174956(a(n))) + 1.

Examples

			See A138510.
		

Crossrefs

Cf. A138510.
Complement of A251728 in A001358.
Subsequence of A088381.
An intersection of A001358 (semiprimes) and A251727.
Also an intersection of A001358 and A253569, from the latter which this sequence differs for the first time at n=60, where A253569(60) = 290, while here a(60) = 291.
Also an intersection A001358 and A245729.

Programs

Formula

Other identities. For all n >= 1 it holds that:
A138510(A174956(a(n))) = A084127(A174956(a(n))) + 1.

Extensions

Wrong comment corrected by Reinhard Zumkeller, Dec 16 2014
New definition by Antti Karttunen, Jan 01 2015; old definition moved to comment.
More terms from Antti Karttunen, Jan 09 2015

A084968 Multiples of 7 coprime to 30.

Original entry on oeis.org

7, 49, 77, 91, 119, 133, 161, 203, 217, 259, 287, 301, 329, 343, 371, 413, 427, 469, 497, 511, 539, 553, 581, 623, 637, 679, 707, 721, 749, 763, 791, 833, 847, 889, 917, 931, 959, 973, 1001, 1043, 1057, 1099, 1127, 1141, 1169, 1183, 1211, 1253, 1267, 1309
Offset: 1

Views

Author

Robert G. Wilson v, Jun 15 2003

Keywords

Comments

Numbers 7*k such that gcd(k,30) = 1.
Numbers congruent to 7, 49, 77, 91, 119, 133, 161, 203 modulo 210. - Jianing Song, Nov 18 2022

Examples

			77 is in the sequence because gcd(77, 30) = 1.
84 is not in the sequence because gcd(84, 3) = 6.
91 is in the sequence because gcd(91, 30) = 1.
		

Crossrefs

Subsequence of A008589.
Fourth row of A083140.
Cf. A084967 (5), A084969 (11), A084970 (13), A332799 (17), A332798 (19), A332797 (23), A007775 (7-rough numbers).

Programs

  • Maple
    q:= k-> igcd(k, 30)=1:
    select(q, [7*i$i=1..300])[];  # Alois P. Heinz, Feb 25 2020
  • Mathematica
    7Select[ Range[190], GCD[ #, 2*3*5] == 1 & ]
  • PARI
    is(n)=gcd(210,n)==7 \\ Charles R Greathouse IV, Aug 05 2013

Formula

G.f.: 7*x*(x^8 + 6*x^7 + 4*x^6 + 2*x^5 + 4*x^4 + 2*x^3 + 4*x^2 + 6*x + 1) / ((x-1)^2*(x+1)*(x^2+1)*(x^4+1)). - Colin Barker, Feb 24 2013
Lim_{n->oo} a(n)/n = A038111(4)/A038110(4) = 105/4. - Vladimir Shevelev, Jan 20 2015
a(n) = 7*A007775(n).
a(n+8) = a(n) + 210. - Jianing Song, Nov 18 2022
Sum_{n>=1} (-1)^(n+1)/a(n) = sqrt(23 + sqrt(5) - sqrt(6*(5 + sqrt(5))))*Pi/105. - Amiram Eldar, Jul 15 2023

A255407 Permutation of natural numbers: a(n) = A255127(A252460(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Feb 22 2015

Keywords

Comments

a(n) tells which number in Ludic array A255127 is at the same position where n is in array A083221, the sieve of Eratosthenes. As both arrays have A005843 (even numbers) and A016945 as their two topmost rows, both sequences are among the fixed points of this permutation.
Equally: a(n) tells which number in array A255129 is at the same position where n is in the array A083140, as they are the transposes of above two arrays.

Examples

			A083221(8,1) = 19 and A255127(8,1) = 23, thus a(19) = 23.
A083221(9,1) = 23 and A255127(9,1) = 25, thus a(23) = 25.
A083221(3,2) = 25 and A255127(3,2) = 19, thus a(25) = 19.
		

Crossrefs

Inverse: A255408.
Similar permutations: A249818.

Formula

a(n) = A255127(A252460(n)).
Other identities. For all n >= 1:
a(2n) = 2n. [Fixes even numbers.]
a(3n) = 3n. [Fixes multiples of three.]
a(A008578(n)) = A003309(n). [Maps noncomposites to Ludic numbers.]
a(A001248(n)) = A254100(n). [Maps squares of primes to "postludic numbers".]
a(A084967(n)) = a(5*A007310(n)) = A007310((5*n)-3) = A255413(n). [Maps A084967 to A255413.]
(And similarly between other columns and rows of A083221 and A255127.)

A095904 Triangular array of natural numbers (greater than 1) arranged by prime signature.

Original entry on oeis.org

2, 3, 4, 5, 9, 6, 7, 25, 10, 8, 11, 49, 14, 27, 12, 13, 121, 15, 125, 18, 16, 17, 169, 21, 343, 20, 81, 24, 19, 289, 22, 1331, 28, 625, 40, 30, 23, 361, 26, 2197, 44, 2401, 54, 42, 32, 29, 529, 33, 4913, 45, 14641, 56, 66, 243, 36, 31, 841, 34, 6859, 50, 28561, 88, 70
Offset: 0

Views

Author

Alford Arnold, Jul 10 2004

Keywords

Comments

The unit, 1, has the empty prime signature { } (thus not in triangle).
Downwards diagonals:
* Rightmost diagonal: smallest numbers of a given prime signature in increasing order (A025487). This defines the order of signatures used.
This special ordering of prime signatures (by increasing smallest numbers of a given prime signature, A181087) is unrelated to any of the 8 variants of graded lexicographic or colexicographic orderings (based on the exponents only) since it depends on the magnitudes of the prime numbers. It is not even graded by Omega(n).
* Second rightmost diagonal: second smallest numbers of a given prime signature (A077560). (They are not increasing anymore.)
Upwards diagonals:
* Leftmost diagonal: primes. {1} (A000040)
* 2nd leftmost diagonal: squares of primes. {2} (A001248)
* 3rd leftmost diagonal: squarefree biprimes. {1,1} (A006881)
* 4th leftmost diagonal: cubes of primes. {3} (A030078)
* 5th leftmost diagonal: signature (Achilles numbers) {1,2} (A054753)
* 6th leftmost diagonal: fourth powers of primes. {4} (A030514)
* 7th leftmost diagonal: signature (Achilles numbers) {1,3} (A065036)
* 8th leftmost diagonal: squarefree triprimes. {1,1,1} (A007304)
The Achilles numbers are nonsquarefree while not perfect powers.
Prime signatures are often expressed in increasing order of exponents. The decreasing order of exponents (as on the Wiki page, see links) has the advantage of listing the exponents in the same order (with the canonical factorization convention) as the smallest number of a given prime signature.

Examples

			343 is in the 4th left- and 4th rightmost diagonal, because it is the 4th value with the 4th prime signature {3}.
First 8 rows of triangular array (Cf. table link for this sequence):
                                   2
                              3         4
                         5         9         6
                    7        25        10         8
               11       49        14        27        12
          13      121        15       125        18        16
     17       169       21       343        20        81        24
19       289       22       1331       28       625        40        30
		

Crossrefs

Extensions

Extended by Ray Chandler, Jul 31 2004
Corrected (minor) by Daniel Forgues, Jan 21 2011
Example, comments by Daniel Forgues, Jan 21 2011
Edited by Alois P. Heinz, Jan 23 2011
Edited by Daniel Forgues, Jan 23 2011

A084970 Numbers whose smallest prime factor is 13.

Original entry on oeis.org

13, 169, 221, 247, 299, 377, 403, 481, 533, 559, 611, 689, 767, 793, 871, 923, 949, 1027, 1079, 1157, 1261, 1313, 1339, 1391, 1417, 1469, 1651, 1703, 1781, 1807, 1937, 1963, 2041, 2119, 2171, 2197, 2249, 2327, 2353, 2483, 2509, 2561, 2587, 2743, 2873
Offset: 1

Views

Author

Robert G. Wilson v, Jun 15 2003

Keywords

Examples

			a(2) = 13*13, a(3) = 13*17.
		

Crossrefs

Sixth row of A083140.
Cf. A084967 (5), A084968 (7), A084969 (11), A332799 (17), A332798 (19), A332797 (23), A008365 (13-rough numbers).

Programs

Formula

a(n) = a(n-480) + 30030 = a(n-1) + a(n-480) - a(n-481). - Charles R Greathouse IV, Nov 19 2014
Lim_{n->infinity} a(n)/n = A038111(6)/A038110(6) = 1001/16 = 62.5625. - Vladimir Shevelev, Jan 20 2015
a(n) = 13*A008365(n).

Extensions

More terms from David Wasserman, Oct 19 2004

A084969 Numbers whose smallest prime factor is 11.

Original entry on oeis.org

11, 121, 143, 187, 209, 253, 319, 341, 407, 451, 473, 517, 583, 649, 671, 737, 781, 803, 869, 913, 979, 1067, 1111, 1133, 1177, 1199, 1243, 1331, 1397, 1441, 1507, 1529, 1573, 1639, 1661, 1727, 1793, 1837, 1859, 1903, 1969, 1991, 2057, 2101, 2123, 2167, 2189, 2299, 2321
Offset: 1

Views

Author

Robert G. Wilson v, Jun 15 2003

Keywords

Comments

Fifth row of A083140.
Integers k such that gcd(11*k, 210) = 1.

Examples

			a(2) = 11*11, a(3) = 11*13.
		

Crossrefs

Cf. A084967 (5), A084968 (7), A084970 (13), A332799 (17), A332798 (19), A332797 (23), A008364 (11-rough numbers).

Programs

  • Mathematica
    11Select[ Range[210], GCD[ #, 2*3*5*7] == 1 & ]
    Select[11*Range[0,200],GCD[#,210]==1&] (* Harvey P. Dale, Dec 23 2013 *)
  • PARI
    is(n)=gcd(n,2310)==11 \\ Charles R Greathouse IV, Nov 19 2014

Formula

G.f.: 11*x*(x^48 +10*x^47 +2*x^46 +4*x^45 +2*x^44 +4*x^43 +6*x^42 +2*x^41 +6*x^40 +4*x^39 +2*x^38 +4*x^37 +6*x^36 +6*x^35 +2*x^34 +6*x^33 +4*x^32 +2*x^31 +6*x^30 +4*x^29 +6*x^28 +8*x^27 +4*x^26 +2*x^25 +4*x^24 +2*x^23 +4*x^22 +8*x^21 +6*x^20 +4*x^19 +6*x^18 +2*x^17 +4*x^16 +6*x^15 +2*x^14 +6*x^13 +6*x^12 +4*x^11 +2*x^10 +4*x^9 +6*x^8 +2*x^7 +6*x^6 +4*x^5 +2*x^4 +4*x^3 +2*x^2 +10*x +1) / (x^49 -x^48 -x +1). - Colin Barker, Feb 22 2013
a(n) = a(n-48) + 2310 = a(n-1) + a(n-48) - a(n-49). - Charles R Greathouse IV, Nov 19 2014
Lim_{n->infinity} a(n)/n = A038111(5)/A038110(5) = 385/8 = 48.125. - Vladimir Shevelev, Jan 20 2015
a(n) = 11*A008364(n).

Extensions

a(47)-a(49) from Georg Fischer, Nov 07 2019
New name from Frank Ellermann, Feb 25 2020

A255408 Permutation of natural numbers: a(n) = A083221(A255128(n)).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 25, 20, 21, 22, 19, 24, 23, 26, 27, 28, 29, 30, 49, 32, 33, 34, 35, 36, 31, 38, 39, 40, 37, 42, 41, 44, 45, 46, 43, 48, 55, 50, 51, 52, 47, 54, 121, 56, 57, 58, 77, 60, 53, 62, 63, 64, 65, 66, 59, 68, 69, 70, 61, 72, 169, 74, 75, 76, 67, 78, 85, 80, 81, 82, 71, 84, 91, 86, 87
Offset: 1

Views

Author

Antti Karttunen, Feb 22 2015

Keywords

Comments

a(n) tells which number in array A083221 (the sieve of Eratosthenes) is at the same position where n is in Ludic array A255127. As both arrays have A005843 (even numbers) and A016945 as their two topmost rows, both sequences are among the fixed points of this permutation.
Equally: a(n) tells which number in array A083140 is at the same position where n is in the array A255129, as they are the transposes of above two arrays.

Examples

			A255127(3,2) = 19 and A083221(3,2) = 25, thus a(19) = 25.
A255127(8,1) = 23 and A083221(8,1) = 19, thus a(23) = 19.
A255127(9,1) = 25 and A083221(9,1) = 23, thus a(25) = 23.
		

Crossrefs

Inverse: A255407.
Similar permutations: A249817.

Programs

Formula

a(n) = A083221(A255128(n)).
Other identities. For all n >= 1:
a(2n) = 2n. [Fixes even numbers.]
a(3n) = 3n. [Fixes multiples of three.]
a(A003309(n)) = A008578(n). [Maps Ludic numbers to noncomposites.]
Previous Showing 11-20 of 47 results. Next