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.

A346007 Let b=5. If n == -i (mod b) for 0 <= i < b, then a(n) = binomial(b,i+1)*((n+i)/b)^(i+1).

Table of values

n a(n)
0 0
1 1
2 5
3 10
4 10
5 5
6 32
7 80
8 80
9 40
10 10
11 243
12 405
13 270
14 90
15 15
16 1024
17 1280
18 640
19 160
20 20
21 3125
22 3125
23 1250
24 250
25 25
26 7776
27 6480
28 2160
29 360
30 30
31 16807
32 12005
33 3430
34 490
35 35
36 32768
37 20480
38 5120
39 640
40 40
41 59049
42 32805
43 7290
44 810
45 45
46 100000
47 50000
48 10000
49 1000
50 50

List of values

[0, 1, 5, 10, 10, 5, 32, 80, 80, 40, 10, 243, 405, 270, 90, 15, 1024, 1280, 640, 160, 20, 3125, 3125, 1250, 250, 25, 7776, 6480, 2160, 360, 30, 16807, 12005, 3430, 490, 35, 32768, 20480, 5120, 640, 40, 59049, 32805, 7290, 810, 45, 100000, 50000, 10000, 1000, 50]