cp's OEIS Frontend

For any number n > 0, let f(n) be the polynomial in a single indeterminate x where the coefficient of x^e is the prime(1+e)-adic valuation of n (where prime(k) denotes the k-th prime); f establishes a bijection between the positive numbers and the polynomials in a single indeterminate x with nonnegative integer coefficients; let g be the inverse of f; T(n, k) = g(f(n) * f(k)).

This table has many similarities with A248601.

For any n > 0 and m > 0, f(n * m) = f(n) + f(m).

Also, f(1) = 0 and f(2) = 1.

The function f can be naturally extended to the set of positive rational numbers: if r = u/v (not necessarily in reduced form), then f(r) = f(u) - f(v); as such, f is a homomorphism from the multiplicative group of positive rational numbers to the additive group of polynomials of a single indeterminate x with integer coefficients.

See A297473 for the main diagonal of T.

As a binary operation, T(.,.) is related to A306697(.,.) and A329329(.,.). When their operands are terms of A050376 (sometimes called Fermi-Dirac primes) the three operations give the same result. However the rest of the multiplication table for T(.,.) can be derived from these results because T(.,.) distributes over integer multiplication (A003991), whereas for A306697 and A329329, the equivalent derivation uses distribution over A059896(.,.) and A059897(.,.) respectively. - Peter Munn, Mar 25 2020

From Peter Munn, Jun 16 2021: (Start)

The operation defined by this sequence can be extended to be the multiplicative operator of a ring over the positive rationals that is isomorphic to the polynomial ring Z[x]. The extended function f (described in the author's original comments) is the isomorphism we use, and it has the same relationship with the extended operation that exists between their unextended equivalents.

Denoting this extension of T(.,.) as t_Q(.,.), we get t_Q(n, 1/k) = t_Q(1/n, k) = 1/T(n, k) and t_Q(1/n, 1/k) = T(n, k) for positive integers n and k. The result for other rationals is derived from the distributive property: t_Q(q, r*s) = t_Q(q, r) * t_Q(q, s); t_Q(q*r, s) = t_Q(q, s) * t_Q(r, s). This may look unusual because standard multiplication of rational numbers takes on the role of the ring's additive group.

There are many OEIS sequences that can be shown to be a list of the integers in an ideal of this ring. See the cross-references.

There are some completely additive sequences that similarly define by extension completely additive functions on the positive rationals that can be shown to be homomorphisms from this ring onto the integer ring Z, and these functions relate to some of the ideals. For example, the extended function of A048675, denoted A048675_Q, maps i/j to A048675(i) - A048675(j) for positive integers i and j. For any positive integer k, the set {r rational > 0 : k divides A048675_Q(r)} forms an ideal of the ring; for k=2 and k=3 the integers in this ideal are listed in A003159 and A332820 respectively.

(End)

Next term is too big to include.

a(n+1) = a(n) written in base 3 and read as if in base 27 (and recorded in base 10).

Number of distinct n-ary operators in a ternary logic. - Ross Drewe, Feb 13 2008

The next term has 116 digits. - Harvey P. Dale, Mar 28 2019

For the general case of "Number of iterations f(f(f(...(n)...))) such that the result is < q, where f(x) = x^(1/p)", with p > 1, q > 1, the resulting g.f. is g(x) = 1/(1 - x)*Sum_{k>=0} x^(q^(p^k))

= (x^q + x^(q^p) + x^(q^(p^2)) + x^(q^(p^3)) + ...)/(1 - x).

The first term that equals 3 is a(512). - Harvey P. Dale, Jan 02 2015

An explicit formula for a(n) is not known, although it arises from a recurrence and the corresponding denominators are simply 2^(3^n) = A023365(n+1).

Next term is too large to include.

Proven to be a transcendental number by Borwein and Coons (2008).

A unimodal Collatz sequence has one peak because it starts with only odd numbers (which increase) followed by only even numbers (which decrease). It uses the rule odd x -> (3x+1)/2.

A sequence of length a(n) starts with exactly n odd numbers and ends with 3^(n-1) even numbers and the final 1 for a total length of n + 3^(n-1) + 1.

The peak of a given sequence is 2^(3^(n-1)). See A023365.

a(n) refers to the total number of both red and blue tiles covering the n X n matrix, and thus all the terms are even.

The number of digits of a(n) is 1, 3, 15, 75, 376, 1881, 9407, 47036, 235180, 1175898, ....

-1/(4*a(n)) is the coefficient of x^0 of the minimal polynomial Psi(5^n,x) of cos(2*Pi/5^n). Hence 4*a(n)*Psi(5^n,x) is the integer polynomial with coefficient -1 of x^0. E.g., Psi(5,1)= x^2 + (1/2)*x -1/4, Psi(25,x)= x^10 + ... -1/1024. See A181875/A181876, A181877 and the W. Lang link under A181875.