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.

A145737 a(n) = square part of A145609(n).

Original entry on oeis.org

1, 5, 7, 1, 11, 13, 1, 17, 19, 1, 23, 1, 1, 29, 31, 1, 1, 37, 1, 41, 43, 1, 47, 1, 1, 53, 1, 1, 59, 61, 1, 1, 67, 1, 71, 73, 1, 1, 79, 1, 83, 1, 1, 89, 1, 1, 1, 97, 1, 101, 103, 1, 107, 109, 1, 113, 1, 1, 1, 1, 1, 1, 127, 1, 131, 1, 1, 137, 139, 1, 1, 1, 1, 149, 151, 1, 1, 157, 1, 1, 163
Offset: 1

Views

Author

Artur Jasinski, Oct 17 2008

Keywords

Comments

For squarefree parts see A145738. A128059 is a very similar sequence.

Crossrefs

Programs

Formula

a(n) = 2n+1 if 2n+1 is prime, 1 otherwise, for n > 1.
From Gary Detlefs, Oct 18 2011: (Start)
a(n) = Denominator(n!*(Sum_{k=1..n} k^3)/(Sum_{k=1..n} k^2))
= Denominator(n!*3*n*(n+1)/(2*(2*n+1))). (End)