cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A369059 a(0) = 0, and for n > 0, a(n) is the square of the product of first n-1 odd primes.

Original entry on oeis.org

0, 1, 9, 225, 11025, 1334025, 225450225, 65155115025, 23520996524025, 12442607161209225, 10464232622576958225, 10056127550296456854225, 13766838616355849433434025, 23142055714094182897602596025, 42789661015360144177667200050225, 94522361182930558488466844910947025, 265513312562851938794103367354850193225
Offset: 0

Views

Author

Antti Karttunen, Jan 19 2024

Keywords

Comments

Terms a(2) .. a(9) are equal to the terms A360435(1..8).

Crossrefs

An upper bound for A368704, and also for A360435(n-1).

Programs

Formula

a(n) = A002620(A002110(n)).
For n > 0, a(n) = A061742(n)/4 = A070826(n)^2.
For n > 0, a(n) >= A368704(n) and for n > 1, a(n) >= A360435(n-1).
For n > 0, A000005(a(n)) = A000244(n-1) = 3^(n-1).
Showing 1-1 of 1 results.