login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0

%I #4 Mar 30 2012 16:49:06

%S 0,2,8,24,26,48,80,120,168,242,288,360,528,728,840,960,1330,1368,1680,

%T 1848,2186,2208,2808,3480,3720,4488,5040,5328,6240,6560,6888,7920,9408

%N 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 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 h i

%e 0 0

%e 2 1

%e - 2

%e 8 3

%e 24 4

%e 26 5

%e 48 6

%e 80 7

%e - 8

%e 120 9

%e 168 10

%e 242 11

%e 288 12

%e 360 13

%e 528 14

%e 728 15

%e 840 16

%e 960 17

%e 1330 18

%e 1368 19

%e 1680 20

%e ...

%e The missing values of i for h <= 10000 are 2, 8 and 26.

%Y Cf. A141586, A141900.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Nov 24 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:39 EDT 2024. Contains 371963 sequences. (Running on oeis4.)