This site is supported by donations to The OEIS Foundation.



Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A281890 Square array A(n,k): number of integers having prime(n) as k-th factor when written as product of primes in nondecreasing order, in any interval of primorial(n)^k positive integers. 3
1, 1, 1, 1, 5, 2, 1, 19, 62, 8, 1, 65, 1322, 1976, 48, 1, 211, 24182, 318392, 140496, 480, 1, 665, 408842, 42729464, 260656752, 19373280, 5760, 1, 2059, 6609302, 5208402488, 395975417424, 485262187680, 4125121920, 92160, 1, 6305, 103999562, 600582229496 (list; table; graph; refs; listen; history; text; internal format)



Square array read by descending antidiagonals: A(n,k) with rows n >= 1, columns k >= 1. Primorial(n) = A002110(n): product of first n primes.

Visualize the prime factorizations of the positive integers as a table with row headings giving each successive integer, and the primes of which the row heading is the product listed across the columns in nondecreasing order, repeated when necessary. Except for 1, which lacks prime factors, column 1 has the row heading's least prime factor, column 2 has a value for composite numbers but is blank for primes, and so on. This sequence measures precisely how frequently the various primes occur in each column. This is possible because any given prime occurs cyclically in any given column, for the reason following.

The occurrence pattern of up to k factors of prime(n) in such prime factorizations has a fundamental period over the positive integers of prime(n)^k. The least common period for up to k factors of each of the first n primes is Primorial(n)^k, and this covers everything that can affect the occurrence of prime(n) in the least k factors. Thus prime(n) is k-th least prime factor of integer m if and only if it is k-th least prime factor of m+Primorial(n)^k.

Intermediate values in the calculation of this sequence appear in A281891.

A(n,1) = A005867(n-1) in accordance with the comment on A005867 dated Jul 16 2006.

A(2,k) = A001047(k) = 3^k - 2^k.


Table of n, a(n) for n=1..40.


A(n,k) = primorial(n-1) * A281891(n,k-1) - prime(n)^(k-1) * A281891(n-1,k).


Prime(2)=3 occurs as second least factor five times in the prime factorizations of every interval of 36=Primorial(2)^2 positive integers. See A014673. So A(2,2) = 5.


A079474 re-read as a square array gives values of primorial(n)^k = A002110(n)^k.

The values in the body of the factorization table described in the author's comments are in the irregular array A027746.

Cf. A001047, A005867, A014673, A281891.

Sequence in context: A118438 A083801 A193590 * A111544 A109281 A133289

Adjacent sequences:  A281887 A281888 A281889 * A281891 A281892 A281893




Peter Munn, Feb 08 2017



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 12 15:01 EST 2017. Contains 295939 sequences.