A276605 -id:A276605 - cp's OEIS frontend

A276603 The infinite trunk of ternary beanstalk, terms divided by 2: a(n) = A276623(n) / 2.

0, 1, 2, 4, 5, 6, 8, 10, 13, 14, 15, 17, 19, 21, 23, 26, 28, 31, 34, 36, 40, 41, 42, 44, 46, 48, 50, 53, 55, 58, 61, 63, 67, 70, 72, 76, 80, 82, 85, 88, 90, 94, 97, 99, 102, 106, 108, 112, 116, 121, 122, 123, 125, 127, 129, 131, 134, 136, 139, 142, 144, 148, 151, 153, 157, 161, 163, 166, 169, 171, 175, 178, 180, 183, 187, 189, 193, 197

Offset: 0

Antti Karttunen, Sep 11 2016

Antti Karttunen, Table of n, a(n) for n = 0..6250

Cf. A276623, A276605 (first differences).

Scheme
```
(define (A276603 n) (/ (A276623 n) 2))
```

a(n) = A276623(n) / 2.

A276604 After a(0)=0, the first differences of A276623.

Original entry on oeis.org

0, 2, 2, 4, 2, 2, 4, 4, 6, 2, 2, 4, 4, 4, 4, 6, 4, 6, 6, 4, 8, 2, 2, 4, 4, 4, 4, 6, 4, 6, 6, 4, 8, 6, 4, 8, 8, 4, 6, 6, 4, 8, 6, 4, 6, 8, 4, 8, 8, 10, 2, 2, 4, 4, 4, 4, 6, 4, 6, 6, 4, 8, 6, 4, 8, 8, 4, 6, 6, 4, 8, 6, 4, 6, 8, 4, 8, 8, 10, 6, 4, 6, 8, 4, 8, 8, 10, 8, 8, 10, 4, 6, 6, 4, 8, 6, 4, 6, 8, 4, 8, 8, 10, 6, 4, 6, 8, 4, 8, 8, 8, 8, 8, 10

Offset: 0

Antti Karttunen, Sep 11 2016

Antti Karttunen, Table of n, a(n) for n = 0..6250

Cf. A053735, A276623, A276605 (terms divided by 2).

a(n) = A053735(A276623(n)).

a(0) = 0; for n >= 1, a(n) = A276623(n) - A276623(n-1).

cp's OEIS Frontend

A276603 The infinite trunk of ternary beanstalk, terms divided by 2: a(n) = A276623(n) / 2.

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme