login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A344229 a(n) = n*a(n-1) + n^signum(n mod 4), a(0) = 1. 3
1, 2, 6, 21, 85, 430, 2586, 18109, 144873, 1303866, 13038670, 143425381, 1721104573, 22374359462, 313241032482, 4698615487245, 75177847795921, 1278023412530674, 23004421425552150, 437084007085490869, 8741680141709817381, 183575282975906165022 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
This sequence is one of many possible solutions to puzzle 16 on the Meerdaelquiz puzzle page, cf. the Delestinne link and A090805.
LINKS
Hugo Delestinne, Meerdaelquiz [broken link]
Neil Sloane and Brady Haran, A Sequence with a Mistake, Numberphile video (2021)
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);
CROSSREFS
Sequence in context: A326276 A099947 A121726 * A090805 A150226 A326335
KEYWORD
nonn
AUTHOR
Alois P. Heinz, May 12 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 06:12 EDT 2024. Contains 372020 sequences. (Running on oeis4.)