[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A025632 revision #12

A025632
Numbers of form 7^i*10^j, with i, j >= 0.
11
1, 7, 10, 49, 70, 100, 343, 490, 700, 1000, 2401, 3430, 4900, 7000, 10000, 16807, 24010, 34300, 49000, 70000, 100000, 117649, 168070, 240100, 343000, 490000, 700000, 823543, 1000000, 1176490, 1680700, 2401000, 3430000, 4900000, 5764801, 7000000
OFFSET
1,2
LINKS
FORMULA
Sum_{n>=1} 1/a(n) = (7*10)/((7-1)*(10-1)) = 35/27. - Amiram Eldar, Sep 25 2020
MATHEMATICA
n = 10^6; Flatten[Table[7^i*10^j, {i, 0, Log[7, n]}, {j, 0, Log10[n/7^i]}]] // Sort (* Amiram Eldar, Sep 25 2020 *)
PROG
(Haskell)
import Data.Set (singleton, deleteFindMin, insert)
a025632 n = a025632_list !! (n-1)
a025632_list = f $ singleton (1, 0, 0) where
f s = y : f (insert (7 * y, i + 1, j) $ insert (10 * y, i, j + 1) s')
where ((y, i, j), s') = deleteFindMin s
-- Reinhard Zumkeller, May 15 2015
(PARI) list(lim)=my(v=List(), N); for(n=0, logint(lim\=1, 10), N=10^n; while(N<=lim, listput(v, N); N*=7)); Set(v) \\ Charles R Greathouse IV, Jan 10 2018
KEYWORD
easy,nonn
STATUS
editing