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.

A062247 Let f(h) = A141900(h) = 2^h * 3^i * 5^j * ... be the smallest term in A141586 that is divisible by 2^h but not by 2^(h+1). Sequence gives values of h where i increases.

Original entry on oeis.org

0, 2, 8, 24, 26, 48, 80, 120, 168, 242, 288, 360, 528, 728, 840, 960, 1330, 1368, 1680, 1848, 2186, 2208, 2808, 3480, 3720, 4488, 5040, 5328, 6240, 6560, 6888, 7920, 9408
Offset: 1

Views

Author

N. J. A. Sloane, Nov 24 2008

Keywords

Examples

			Pairs (h,i) where A141900 contains a term 2^h*3^i*... for the first time, with a dash if that value of i never occurs:
h i
0 0
2 1
- 2
8 3
24 4
26 5
48 6
80 7
- 8
120 9
168 10
242 11
288 12
360 13
528 14
728 15
840 16
960 17
1330 18
1368 19
1680 20
...
The missing values of i for h <= 10000 are 2, 8 and 26.
		

Crossrefs