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.

A344229 a(n) = n*a(n-1) + n^signum(n mod 4), a(0) = 1.

Original entry on oeis.org

1, 2, 6, 21, 85, 430, 2586, 18109, 144873, 1303866, 13038670, 143425381, 1721104573, 22374359462, 313241032482, 4698615487245, 75177847795921, 1278023412530674, 23004421425552150, 437084007085490869, 8741680141709817381, 183575282975906165022
Offset: 0

Views

Author

Alois P. Heinz, May 12 2021

Keywords

Comments

This sequence is one of many possible solutions to puzzle 16 on the Meerdaelquiz puzzle page, cf. the Delestinne link and A090805.

Crossrefs

Programs

  • Maple
    a:= proc(n) a(n):= n*a(n-1) + n^signum(n mod 4) end: a(0):= 1:
    seq(a(n), n=0..23);