The On-Line Encyclopedia of Integer Sequences (OEIS)

Revisions by Bruno Berselli

(See also Bruno Berselli's wiki page
and changes approved by Bruno Berselli)

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A199854

Primes of the form 1 + m^2 + n^2 with gcd(m,n)=1.
(history; published version)

#23 by Bruno Berselli at Mon Sep 30 10:51:29 EDT 2024

STATUS

proposed

approved

Discussion

Mon Sep 30

10:51

OEIS Server: Installed first b-file as b199854.txt.

A140534

Primes congruent to 11 or 199 mod 210.
(history; published version)

#26 by Bruno Berselli at Mon Sep 30 10:50:45 EDT 2024

STATUS

reviewed

approved

A120380

Number of partitions of n*(n+1).
(history; published version)

#22 by Bruno Berselli at Mon Sep 30 10:50:29 EDT 2024

STATUS

proposed

approved

A375564

a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest unused positive number that is coprime to a(n-1) if a(n-1) is prime, otherwise a(n) shares a factor with a(n-1).
(history; published version)

#34 by Bruno Berselli at Mon Sep 30 10:49:14 EDT 2024

STATUS

reviewed

approved

A325306

Numbers which are represented by more than one partition of the same integer.
(history; published version)

#36 by Bruno Berselli at Mon Sep 30 10:47:06 EDT 2024

STATUS

reviewed

approved

Discussion

Mon Sep 30

10:47

OEIS Server: Installed first b-file as b325306.txt.

A086974

Numbers of the form p^2 * q * r with distinct primes p, q and r such that p^2 < q*r.
(history; published version)

#15 by Bruno Berselli at Sun Sep 15 06:53:07 EDT 2024

STATUS

reviewed

approved

Discussion

Sun Sep 15

06:53

OEIS Server: Installed first b-file as b086974.txt.

A121735

Real term generated from a complex product operation.
(history; published version)

#13 by Bruno Berselli at Sun Sep 15 06:52:19 EDT 2024

STATUS

reviewed

approved

A121927

Minimum k>0 such that Sum_{i=1..n} Fibonacci(i)*k^(i-1) is prime.
(history; published version)

#6 by Bruno Berselli at Sun Sep 15 06:52:06 EDT 2024

STATUS

reviewed

approved

A121928

a(n) = ceiling(n*(e^Pi - Pi^e)).
(history; published version)

#27 by Bruno Berselli at Sun Sep 15 06:51:38 EDT 2024

STATUS

reviewed

approved

A122017

a(n) = if n even then a(n - 1) - (n - 1)*a(n - 2) otherwise 2*(a(n - 1) + (n - 1)*a(n - 2)).
(history; published version)

#12 by Bruno Berselli at Sun Sep 15 06:51:27 EDT 2024

STATUS

reviewed

approved