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.

A243287 a(1)=1, and for n > 1, if n is k-th number divisible by the square of its largest prime factor (i.e., n = A070003(k)), a(n) = 1 + (2*a(k)); otherwise, when n = A102750(k), a(n) = 2*a(k).

Table of values

n a(n)
1 1
2 2
3 4
4 3
5 8
6 6
7 16
8 5
9 9
10 12
11 32
12 10
13 18
14 24
15 64
16 7
17 20
18 17
19 36
20 48
21 128
22 14
23 40
24 34
25 13
26 72
27 33
28 96
29 256
30 28
31 80
32 11
33 68
34 26
35 144
36 19
37 66
38 192
39 512
40 56
41 160
42 22
43 136
44 52
45 288
46 38
47 132
48 384
49 25
50 65
51 1024
52 112
53 320
54 21
55 44
56 272
57 104
58 576
59 76
60 264
61 768
62 50
63 130
64 37
65 2048

List of values

[1, 2, 4, 3, 8, 6, 16, 5, 9, 12, 32, 10, 18, 24, 64, 7, 20, 17, 36, 48, 128, 14, 40, 34, 13, 72, 33, 96, 256, 28, 80, 11, 68, 26, 144, 19, 66, 192, 512, 56, 160, 22, 136, 52, 288, 38, 132, 384, 25, 65, 1024, 112, 320, 21, 44, 272, 104, 576, 76, 264, 768, 50, 130, 37, 2048]