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.

A179508 a(n) is the unique integer such that Sum_{k=0..p-1} b(k)/(-n)^k == a(n) (mod p) for any prime p not dividing n, where b(0), b(1), b(2), ... are Bell numbers given by A000110.

Table of values

n a(n)
1 2
2 1
3 2
4 -1
5 10
6 -43
7 266
8 -1853
9 14834
10 -133495
11 1334962
12 -14684569
13 176214842
14 -2290792931
15 32071101050
16 -481066515733
17 7697064251746
18 -130850092279663
19 2355301661033954
20 -44750731559645105
21 895014631192902122
22 -18795307255050944539

List of values

[2, 1, 2, -1, 10, -43, 266, -1853, 14834, -133495, 1334962, -14684569, 176214842, -2290792931, 32071101050, -481066515733, 7697064251746, -130850092279663, 2355301661033954, -44750731559645105, 895014631192902122, -18795307255050944539]