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.

A074484 a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482).

Original entry on oeis.org

38606, 38606, 38606, 8, 48, 48, 192, 192, 304, 96, 16, 304, 304, 72, 44, 160, 1170558326, 160, 96, 128, 190, 392472, 1980, 6560, 3304, 32, 6560, 6560, 114, 22348, 6240, 230, 392472, 5920, 5920, 5920, 592362276, 592362276, 18154867024, 18154867024
Offset: 0

Views

Author

Keywords

Comments

a(n) = A074482(n)*(A074483(n)+ n + 1).

Examples

			a(0) = A073117(A074483(0)) = A073117(397) = 38606.
		

Crossrefs