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.

A347469 For irrational r > 1, let B(r) denote the Beatty sequence for r. Let (s(n)) be the increasing sequence of numbers in both B(sqrt(2)) and B(sqrt(3)). Then this sequence gives the numbers k such that s(k) = floor(k*sqrt(6)).

Table of values

n a(n)
1 1
2 20
3 21
4 23
5 49
6 70
7 71
8 72
9 73
10 74
11 75
12 76
13 78
14 98
15 101
16 102
17 117
18 148
19 194
20 215
21 216
22 250
23 257
24 262
25 299
26 300
27 307
28 310
29 344
30 346
31 357
32 360
33 361
34 448
35 1071
36 1075
37 1083
38 1114
39 1143
40 1160
41 1203
42 1681
43 1722
44 1725
45 1727
46 1737
47 1740
48 1741
49 1770
50 1771
51 1783

List of values

[1, 20, 21, 23, 49, 70, 71, 72, 73, 74, 75, 76, 78, 98, 101, 102, 117, 148, 194, 215, 216, 250, 257, 262, 299, 300, 307, 310, 344, 346, 357, 360, 361, 448, 1071, 1075, 1083, 1114, 1143, 1160, 1203, 1681, 1722, 1725, 1727, 1737, 1740, 1741, 1770, 1771, 1783]