cp's OEIS Frontend

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.

%I A062247 #4 Mar 30 2012 16:49:06
%S A062247 0,2,8,24,26,48,80,120,168,242,288,360,528,728,840,960,1330,1368,1680,
%T A062247 1848,2186,2208,2808,3480,3720,4488,5040,5328,6240,6560,6888,7920,9408
%N 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.
%e A062247 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:
%e A062247 h i
%e A062247 0 0
%e A062247 2 1
%e A062247 - 2
%e A062247 8 3
%e A062247 24 4
%e A062247 26 5
%e A062247 48 6
%e A062247 80 7
%e A062247 - 8
%e A062247 120 9
%e A062247 168 10
%e A062247 242 11
%e A062247 288 12
%e A062247 360 13
%e A062247 528 14
%e A062247 728 15
%e A062247 840 16
%e A062247 960 17
%e A062247 1330 18
%e A062247 1368 19
%e A062247 1680 20
%e A062247 ...
%e A062247 The missing values of i for h <= 10000 are 2, 8 and 26.
%Y A062247 Cf. A141586, A141900.
%K A062247 nonn
%O A062247 1,2
%A A062247 _N. J. A. Sloane_, Nov 24 2008