This site is supported by donations to The OEIS Foundation.

User:Russell Y. Webb

From OeisWiki
Jump to: navigation, search

Former University of Canterbury academic, now doing image processing research and dabbling in number theory.

email: nthlab@gmail.com

Sequences:

1. a(0) = 2; thereafter a(n) = smallest integer not a multiple of an earlier terms nor a sum of two earlier terms

https://oeis.org/A140460

2. Number of distinct n-digit patterns in base 10 such that the pattern and its reverse are prime. Definitely silly since is uses a particular base. Also interesting to wonder if the sequence is infinite.

https://oeis.org/A256623

3. The prime factorization of a(n) describes all previous terms in the sequence: a(n) = prime(a(1))^1 * prime(a(2))^2 * prime(a(3))^3 * ...* prime(a(n-1))^(n-1).

https://oeis.org/A321339

4. The prime factorization of a(n) describes all previous terms in the sequence: a(n) = prime(1)^a(1) * prime(2)^a(2) * prime(3)^a(3) * ...* prime(n-1)^a(n-1).

https://oeis.org/A321340