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.

A304715 For any n > 0, if A006666(n) >= 0, then a(n) = Sum_{i = 0..A006666(n)-1} 2^i * [T^i(n) == 0 (mod 2)] (where [] is an Iverson bracket and T^i denotes the i-th iterate of the Collatz function A014682); otherwise a(n) = -1.

Table of values

n a(n)
1 0
2 1
3 28
4 3
5 14
6 57
7 1896
8 7
9 7586
10 29
11 948
12 115
13 118
14 3793
15 3824
16 15
17 474
18 15173
19 15180
20 59
21 62
22 1897
23 1912
24 231
25 60722
26 237
27 1102691417057682138372
28 7587
29 7590
30 7649
31 137836427132210267296
32 31
33 242890
34 949
35 956
36 30347
37 30350
38 30361
39 7772616
40 119

List of values

[0, 1, 28, 3, 14, 57, 1896, 7, 7586, 29, 948, 115, 118, 3793, 3824, 15, 474, 15173, 15180, 59, 62, 1897, 1912, 231, 60722, 237, 1102691417057682138372, 7587, 7590, 7649, 137836427132210267296, 31, 242890, 949, 956, 30347, 30350, 30361, 7772616, 119]