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.

A284003 a(n) = A007913(A283477(n)) = A019565(A006068(n)).

Original entry on oeis.org

1, 2, 6, 3, 30, 15, 5, 10, 210, 105, 35, 70, 7, 14, 42, 21, 2310, 1155, 385, 770, 77, 154, 462, 231, 11, 22, 66, 33, 330, 165, 55, 110, 30030, 15015, 5005, 10010, 1001, 2002, 6006, 3003, 143, 286, 858, 429, 4290, 2145, 715, 1430, 13, 26, 78, 39, 390, 195, 65, 130, 2730, 1365, 455, 910, 91, 182, 546, 273, 510510, 255255, 85085, 170170, 17017
Offset: 0

Views

Author

Antti Karttunen, Mar 18 2017

Keywords

Comments

A squarefree analog of A302783. Each term is either a divisor or a multiple of the next one. In contrast to A302033 at each step the previous term can be multiplied (or divided), not just by a single prime, but possibly by a product of several distinct ones, A019565(A000975(k)). E.g., a(3) = 3, a(4) = 2*5*a(3) = 30. - Antti Karttunen, Apr 17 2018

Crossrefs

Programs

Formula

a(n) = A007913(A283477(n)).
Other identities. For all n >= 0:
A048675(a(n)) = A006068(n).
A046523(a(n)) = A284004(n).
It seems that A001222(a(n)) = A209281(n).
a(n) = A019565(A006068(n)) = A302033(A064707(n)). - Antti Karttunen, Apr 16 2018

Extensions

Name amended with a second formula by Antti Karttunen, Apr 16 2018