login
This site is supported by donations to The OEIS Foundation.

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003598 Numbers of the form 5^i * 11^j. 22
1, 5, 11, 25, 55, 121, 125, 275, 605, 625, 1331, 1375, 3025, 3125, 6655, 6875, 14641, 15125, 15625, 33275, 34375, 73205, 75625, 78125, 161051, 166375, 171875, 366025, 378125, 390625, 805255, 831875, 859375, 1771561, 1830125, 1890625 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

FORMULA

An asymptotic formula for a(n) is roughly 1/sqrt(55)*exp(sqrt(2*log(5)*log(11)*n)). - Benoit Cloitre, Mar 08 2002

MATHEMATICA

Take[Union[(5^#[[1]] 11^#[[2]])&/@Tuples[Range[0, 20], {2}]], 50]  (* Harvey P. Dale, Dec 26 2010 *)

PROG

(PARI) list(lim)=my(v=List(), N); for(n=0, log(lim)\log(11), N=11^n; while(N<=lim, listput(v, N); N*=5)); vecsort(Vec(v)) \\ Charles R Greathouse IV, Jun 28 2011

(Haskell)

import Data.Set (singleton, deleteFindMin, insert)

a003598 n = a003598_list !! (n-1)

a003598_list = f $ singleton (1, 0, 0) where

   f s = y : f (insert (5 * y, i + 1, j) $ insert (11 * y, i, j + 1) s')

         where ((y, i, j), s') = deleteFindMin s

-- Reinhard Zumkeller, May 15 2015

CROSSREFS

Cf. A025612, A025616, A025621, A025625, A025629, A025632, A025634, A025635, A108761, A003596, A003597, A107988, A108698, A003599, A107788, A108687, A108779, A108090.

Sequence in context: A167238 A084640 A056739 * A014858 A018368 A050344

Adjacent sequences:  A003595 A003596 A003597 * A003599 A003600 A003601

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified August 27 15:19 EDT 2015. Contains 261092 sequences.