Mathematics

Integer Sequences (OEIS)

Vincenzo Manto is the author of 32 integer sequences in the OEIS database. His work has contributed to the field of integer sequences, ranging from Bigomega-rad resonance numbers (A396594) to Primes prime(k) such that prime(k) - prime(k-1) is a factorial. (A396248).
His most prolific partners include James C. McMahon , Michael De Vlieger .
These sequences have been cited by 35 other sequences, making him a 92.01-percentile contributor.

A397789: a(n) = nearest prime to prime(n)^(3/2).

Created: 7/24/2026 | Author: James C. McMahon and Vincenzo Manto , Jul 09 2026

Cited by: 2 sequences

A397933: Numbers k that are neither squarefree nor powerful such that rad(k)*bigomega(k) = k, where rad = A007947 and bigomega = A001222.

Created: 7/23/2026 | Author: Michael De Vlieger , James C. McMahon , and Vincenzo Manto , Jul 16 2026

Cited by: 3 sequences

A397932: Numbers k that are neither squarefree nor powerful such that rad(k)*omega(k) = k, where rad = A007947 and omega = A001221.

Created: 7/23/2026 | Author: Michael De Vlieger , James C. McMahon , and Vincenzo Manto , Jul 15 2026

Cited by: 3 sequences

A397790: a(n) = prime^2 closest to prime(n)^3.

Created: 7/20/2026 | Author: James C. McMahon and Vincenzo Manto , Jul 09 2026

Cited by: 2 sequences

A397524: Numbers k such that the sums of the digits of k^2, k^3 and k^4 coincide, excluding multiples of 10.

Created: 7/17/2026 | Author: Vincenzo Manto , Jun 29 2026

Cited by: 1 sequences

A396876: Numbers m whose squarefree core equals the number of duplicated prime factors.

Created: 7/16/2026 | Author: Vincenzo Manto , James C. McMahon , and Michael De Vlieger , Jul 08 2026

Cited by: 1 sequences

A397658: Numbers k*P(j) such that bigomega(k) = k - j, where P = A002110 and bigomega = A001222.

Created: 7/12/2026 | Author: Michael De Vlieger , James C. McMahon , and Vincenzo Manto , Jul 03 2026

Cited by: 2 sequences

A396157: Composites k not of the form 8p or 9q, odd prime p, prime q != 3, such that rad(k)*bigomega(k) = k, with rad = A007947 and bigomega = A001222.

Created: 7/11/2026 | Author: Michael De Vlieger , James C. McMahon , and Vincenzo Manto , Jul 04 2026

Cited by: 1 sequences

A397574: Numbers m such that rad(m)^omega(m) = m.

Created: 7/8/2026 | Author: Vincenzo Manto and James C. McMahon , Jul 01 2026

Cited by: 1 sequences

Bigomega-rad resonance numbers A396594: Numbers m such that rad(m) * bigomega(m) = m.

Created: 7/3/2026 | Author: James C. McMahon and Vincenzo Manto , Jun 28 2026

Cited by: 6 sequences

Omega-rad resonance numbers A397221: Numbers m such that rad(m) * omega(m) = m.

Created: 6/27/2026 | Author: Vincenzo Manto and James C. McMahon , Jun 19 2026

Cited by: 6 sequences

A397069: Primes equal to the sum of the k primes beginning with prime(k) for some k.

Created: 6/25/2026 | Author: James C. McMahon and Vincenzo Manto , Jun 17 2026

Cited by: 3 sequences

A397068: Numbers k such that the sum of the k primes beginning with prime(k) is prime.

Created: 6/24/2026 | Author: James C. McMahon and Vincenzo Manto , Jun 17 2026

Cited by: 3 sequences

A397067: Primes prime(k) such that the sum of the k primes beginning with prime(k) is prime.

Created: 6/24/2026 | Author: James C. McMahon and Vincenzo Manto , Jun 15 2026

Cited by: 3 sequences

A394735: Primes prime(k) such that prime(k+1) - prime(k) is a perfect power.

Created: 6/17/2026 | Author: Vincenzo Manto , Jun 10 2026

Cited by: 1 sequences

A396898: Indices k such that prime(k) + 2*prime(k+1) is prime.

Created: 6/14/2026 | Author: James C. McMahon and Vincenzo Manto , Jun 09 2026

Cited by: 1 sequences

Planetary Numbers A396597: Numbers m with exactly two distinct prime factors q and p such that m = q^k * p^j and p > q^k with k, j >= 1.

Created: 6/8/2026 | Author: Vincenzo Manto and James C. McMahon , May 29 2026

Cited by: 1 sequences

A396547: Primes p such that the sum of the distinct prime factors of p-1 is prime.

Created: 6/3/2026 | Author: Vincenzo Manto , May 28 2026

Cited by: 1 sequences

A396340: Primes prime(k) such that prime(k) - prime(k-1) is a Fibonacci number.

Created: 5/28/2026 | Author: Vincenzo Manto , May 23 2026

Cited by: 1 sequences

A395982: Primes p such that the Fermat quotient q = (2^(p-1) - 1)/p mod p satisfies 1 < q < p and q divides p - 1.

Created: 5/27/2026 | Author: Vincenzo Manto , May 13 2026

A396248: Primes prime(k) such that prime(k) - prime(k-1) is a factorial.

Created: 5/27/2026 | Author: Vincenzo Manto , May 20 2026

A395817: Strictly increasing minimal sequence where consecutive terms can be added digit-by-digit without carrying in base 10.

Created: 5/22/2026 | Author: Vincenzo Manto and James C. McMahon , May 07 2026

Cited by: 1 sequences

A395743: Sum of the cumulative number of previous occurrences of the digits of n in the sequence 1..n excluding the current occurrence of each digit.

Created: 5/19/2026 | Author: Vincenzo Manto and James C. McMahon , May 05 2026

Cited by: 1 sequences

A395615: a(n) is the integer obtained by inserting the product (modulo 10) of adjacent digits of n between them.

Created: 5/7/2026 | Author: Vincenzo Manto , May 01 2026

Cited by: 1 sequences

A395179: Maximum number of runs in the binary expansion of integers obtained by changing a single 0-bit to 1 in the binary representation of n considering bits up to and including the first leading 0.

Created: 5/4/2026 | Author: Vincenzo Manto , Apr 15 2026

Cited by: 1 sequences

A395542: Numbers whose number of nonzero digits is identical in base 2 and 5.

Created: 4/29/2026 | Author: Vincenzo Manto , Apr 28 2026

Cited by: 1 sequences

A395344: a(n) is the integer obtained by inserting the sum (modulo 10) of adjacent digits of n between them.

Created: 4/25/2026 | Author: Vincenzo Manto , Apr 20 2026

Cited by: 2 sequences

A392375: Numbers k such that k is coprime to each of its digits and to the sum of its digits.

Created: 4/20/2026 | Author: Vincenzo Manto , Apr 06 2026

Cited by: 1 sequences

Breakable numbers A394905: Smallest number k > n such that the binary Hamming distance between n and k is equal to the number of runs in the binary representation of n, and k has more runs than n.

Created: 4/15/2026 | Author: Vincenzo Manto , Apr 06 2026

Cited by: 2 sequences

A393803: Numbers whose number of nonzero digits is identical in base 2 and 3.

Created: 4/14/2026 | Author: Vincenzo Manto , Mar 29 2026

Cited by: 2 sequences

A394504: Numbers such that each digit d_i is equal to the number of digits to its right that are strictly less than d_i.

Created: 3/29/2026 | Author: Vincenzo Manto , Mar 22 2026

A390002: Leading digit of 15^n.

Created: 10/27/2025 | Author: Vincenzo Manto , Oct 21 2025

Cited by: 1 sequences

Integer Sequences (OEIS)

A397789: a(n) = nearest prime to prime(n)^(3/2).

A397933: Numbers k that are neither squarefree nor powerful such that rad(k)*bigomega(k) = k, where rad = A007947 and bigomega = A001222.

A397932: Numbers k that are neither squarefree nor powerful such that rad(k)*omega(k) = k, where rad = A007947 and omega = A001221.

A397790: a(n) = prime^2 closest to prime(n)^3.

A397524: Numbers k such that the sums of the digits of k^2, k^3 and k^4 coincide, excluding multiples of 10.

A396876: Numbers m whose squarefree core equals the number of duplicated prime factors.

A397658: Numbers k*P(j) such that bigomega(k) = k - j, where P = A002110 and bigomega = A001222.

A396157: Composites k not of the form 8*p or 9*q, odd prime p, prime q != 3, such that rad(k)*bigomega(k) = k, with rad = A007947 and bigomega = A001222.

A397574: Numbers m such that rad(m)^omega(m) = m.

Bigomega-rad resonance numbers A396594: Numbers m such that rad(m) * bigomega(m) = m.

Omega-rad resonance numbers A397221: Numbers m such that rad(m) * omega(m) = m.

A397069: Primes equal to the sum of the k primes beginning with prime(k) for some k.

A397068: Numbers k such that the sum of the k primes beginning with prime(k) is prime.

A397067: Primes prime(k) such that the sum of the k primes beginning with prime(k) is prime.

A394735: Primes prime(k) such that prime(k+1) - prime(k) is a perfect power.

A396898: Indices k such that prime(k) + 2*prime(k+1) is prime.

Planetary Numbers A396597: Numbers m with exactly two distinct prime factors q and p such that m = q^k * p^j and p > q^k with k, j >= 1.

A396547: Primes p such that the sum of the distinct prime factors of p-1 is prime.

A396340: Primes prime(k) such that prime(k) - prime(k-1) is a Fibonacci number.

A395982: Primes p such that the Fermat quotient q = (2^(p-1) - 1)/p mod p satisfies 1 < q < p and q divides p - 1.

A396248: Primes prime(k) such that prime(k) - prime(k-1) is a factorial.

A395817: Strictly increasing minimal sequence where consecutive terms can be added digit-by-digit without carrying in base 10.

A395743: Sum of the cumulative number of previous occurrences of the digits of n in the sequence 1..n excluding the current occurrence of each digit.

A395615: a(n) is the integer obtained by inserting the product (modulo 10) of adjacent digits of n between them.

A395179: Maximum number of runs in the binary expansion of integers obtained by changing a single 0-bit to 1 in the binary representation of n considering bits up to and including the first leading 0.

A395542: Numbers whose number of nonzero digits is identical in base 2 and 5.

A395344: a(n) is the integer obtained by inserting the sum (modulo 10) of adjacent digits of n between them.

A392375: Numbers k such that k is coprime to each of its digits and to the sum of its digits.

Breakable numbers A394905: Smallest number k > n such that the binary Hamming distance between n and k is equal to the number of runs in the binary representation of n, and k has more runs than n.

A393803: Numbers whose number of nonzero digits is identical in base 2 and 3.

A394504: Numbers such that each digit d_i is equal to the number of digits to its right that are strictly less than d_i.

A390002: Leading digit of 15^n.

A396157: Composites k not of the form 8p or 9q, odd prime p, prime q != 3, such that rad(k)*bigomega(k) = k, with rad = A007947 and bigomega = A001222.