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.

A281361 Number of scenarios in the Gift Exchange Game when a gift can be stolen at most 9 times.

Table of values

n a(n)
0 1
1 10
2 352705
3 3047235458767
4 609542744597785306189
5 1214103036523322674154687139158
6 14963835327495031822418126706099787884130
7 836883118002221273912672040462907783367741190535388
8 170589804359366329173961838612841486616626580885839826818966688
9 107640669875812795238625627484701500354901860426640161278022882392148747562
10 185260259482556646382994900799988470488841686941141661692183483756531004879305895810561

List of values

[1, 10, 352705, 3047235458767, 609542744597785306189, 1214103036523322674154687139158, 14963835327495031822418126706099787884130, 836883118002221273912672040462907783367741190535388, 170589804359366329173961838612841486616626580885839826818966688, 107640669875812795238625627484701500354901860426640161278022882392148747562, 185260259482556646382994900799988470488841686941141661692183483756531004879305895810561]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.