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.

A243023 Consider a k-digit number m = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1). Sequence lists the numbers m that divide Sum_{i=1..k-1}{d_(i+1)^d(i)}+d(1)^d(k) (see example below).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 63
11 448
12 1547
13 1693
14 6189068
15 20443796
16 67526389

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 63, 448, 1547, 1693, 6189068, 20443796, 67526389]

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

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