cp's OEIS Frontend

Also numbers n such that the sum of prime indices of n minus the greater of the number of prime factors of n counted with multiplicity and the largest prime index of n is 1. A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798, and their sum is A056239.

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

This array aims the study of the divisibility properties of the Fibonacci numbers A352744. The identity F(n, k) = (-1)^k*F(1 - n, -k) from A352744 shows that negative indices do not add to the divisibility properties of F(n, k).

All rows A(n, .) are pure periodic sequences. The length of the periods is given by (1, A270313). For n > 0 the length of the period of row A(n, .) is <= n.

The period length is 1 for n in (1, A023172) and n for n in (1, A074215), as observed by Robert Israel in A270313. In particular, if n is a power of 2 or a prime (A174090), then the period length is n.

The indices of the zero-free rows are in A353280. A zero-free row A(n, .) means that n will not divide F(k, n) whatever value k takes. For that it is sufficient to check that period(A(n, .)) is zero-free.

If period(A(n, .)) = [k | 0 <= k < n] we call n a 'Fibonacci friend'. In other words, in this case F(k, n) mod n = k for 0 <= k < n. A Fibonacci friend does not have to be prime (since 1 is a Fibonacci friend), but if it is prime then it is congruent to {1, 4} mod 5 (A045468), and all such primes are Fibonacci friends.

To say that n is a Fibonacci friend is equivalent to saying that A(n, n) = 0 and that n divides F(n, n). Fibonacci friends are the indices of the zeros in A002752.

Integers n > 0 that divide Sum{k=0..n-1} (F(k, n) mod n) are congruent to {0, 1, 3, 5} mod 6 (A301729).

A prime index of n is a number m such that prime(m) divides n.

Also the number of squares in the Young diagram of the integer partition with Heinz number n after the first row or the first column, whichever is larger, is removed. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

This is a permutation of the positive integers.

From Peter Munn, May 18 2025: (Start)

Numbers with the same factorization pattern of their sequence of divisors (see A290110) and the same parity appear here in the same column.

For example, each column k > 2 includes the subsequence 2^(k-2) * p for all prime p > 2^(k-2).

(End)

The sequence consists of primes, powers of 2 and 6. Sketch of proof: Let k be the common difference of the arithmetic progression. If n is odd, then 1 and 2 are coprime to n, so k=1 and n is prime. If n==0 (mod 4), then n/2-1 and n/2+1 are coprime to n, so k=2 and n is a power of 2. If n==2 (mod 4), then n/2-2 and n/2+2 are coprime to n, so k divides 4 and n is either 2 or 6.

From Bernard Schott, Jan 08 2021: (Start)

This sequence is the answer to the 2nd problem, proposed by Romania, during the 32nd International Mathematical Olympiad in 1991 at Sigtuna (Sweden) (see the link IMO Compendium and reference Kuczma).

These phi(m) numbers coprimes to m form an arithmetic progression with at least 3 terms iff m = 5 or m >= 7. (End)

The length of row n is given in A338431(n), for n >= 1.

The length of the sublists t(n, k) of the power basis coefficients of DSR(n, k), for k = 1, 2, ..., floor(n/2), is 1 if n = 1, for n >= 2 it is k except for n = n(j) = A111774(j) for which the final A219839(n) sublists have fewer than k members.

Trailing vanishing coefficients of the delta(n) = A055034(n) power base elements <1 = rho(n)^0, rho(n)^1, ..., rho(n)^{delta(n)-1}> are not recorded. The coefficients of the minimal polynomial C(n, x) of rho(n) = 2*cos(Pi/n) of degree delta(n) are given in A187360. C(n, rho(n)) = 0 is used to eliminate all powers of rho with exponent >= delta(n).

The length ratios DSR(n, k) := diagonal(n, k)/side(n) of regular n-gons, for n >= 2, and k = 1, 2, ..., floor(n/2) (distinct diagonals, starting with the side for k = 1, in increasing order) are given by DSR(n, k) = S(k-1, rho(n)), with the Chebyshev S polynomials (A049310). See the W. Lang link.

For n = 2, the degenerate case, diagonal/side = side/side = 1 for k = 1. For n = 1 (a point) diagonal/side is undetermined, and T(1, 1) is set to 1.

For the power basis sublists t(n, k), for k = 1, 2, ..., delta(n), only the k coefficients of S(k-1, x) are present (trailing vanishing coefficients are not recorded). For k = delta(n)+1, ..., floor(n/2) less than k coefficients appear due to elimination via C(n, rho(n)) = 0. E.g., for n = 6 with delta(6) = 2 the only coefficient for k = 3 is 2 (coefficient of rho^0). This appears for n = n(j) = A111774(j), because then floor(n/2) - delta(n) = A219839(n) > 0.

Because A219839(n) = 0 means that n is from A174090, i.e., a prime or a power of 2 (complement of A111774), these rows n have all the sublists t(n, k) with the k coefficients of S(k-1, x), hence they are identical (but the basis differs). See especially the table for the pairs of consecutive numbers n with identical coefficients, like (2, 3), (4, 5), (16, 17), (256, 267), (65536, 65537), ?... (cf. Fermat primes A019434).