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.

A372452 Number of terms of A086893 in the interval [A372444(n), A372444(1+n)].

Original entry on oeis.org

2, 6, 10, 21, 41, 80, 162, 324, 646, 1294, 2586, 5173, 10345, 20691, 41381, 82760, 165522, 331044, 662089, 1324177, 2648353, 5296707, 10593413, 21186827, 42373652, 84747305, 169494609, 338989216, 677978435, 1355956869, 2711913736, 5423827472, 10847654948, 21695309896, 43390619791, 86781239586, 173562479173, 347124958344
Offset: 0

Views

Author

Antti Karttunen, May 05 2024

Keywords

Comments

The formula involving A372451 and A372453 shows that each term is at most +-1 from the corresponding term of A372451, that are the first differences of A372449.

Examples

			Between A372444(0)=27 and A372444(1)=165 there are two terms (53 and 85) of A086893, therefore a(0) = 2.
Between A372444(1)=165 and A372444(2)=8021 there are six terms (213, 341, 853, 1365, 3413, 5461) of A086893, therefore a(1) = 6.
Between A372444(2)=8021 and A372444(3)=12408149 there are 10 terms (13653, 21845, 54613, 87381, 218453, 349525, 873813, 1398101, 3495253, 5592405) of A086893, therefore a(2) = 10.
		

Crossrefs

Programs

Formula

a(n) = A372286(A372444(n)).
a(n) = A372451(n) + [A372453(n)<=0] - [A372453(1+n)<0], where [ ] is the Iverson bracket, yielding 1 or 0 depending on whether the given inequivalence holds or does not hold.