The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A188226 Smallest number having exactly n divisors of the form 8*k + 7. 7
1, 7, 63, 315, 945, 1575, 3465, 19845, 10395, 17325, 26775, 127575, 45045, 266805, 190575, 155925, 135135, 2480625, 225225, 130203045, 405405, 1289925, 2168775, 1715175, 675675, 3898125, 3468465, 1576575, 3239775, 67798585575, 2027025, 16769025, 2297295, 20539575, 42170625, 27286875, 3828825, 117661005 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
A188172(a(n)) = n and A188172(m) <> n for m < a(n).
LINKS
PROG
(Haskell)
import Data.List (elemIndex)
import Data.Maybe (fromJust)
a188226 n = a188226_list !! n
a188226_list =
map (succ . fromJust . (`elemIndex` (map a188172 [1..]))) [0..]
CROSSREFS
Smallest number having exactly n divisors of the form 8*k + i: A343104 (i=1), A343105 (i=3), A343106 (i=5), this sequence (i=7).
Sequence in context: A161201 A007291 A343137 * A055405 A100741 A043027
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 26 2011
EXTENSIONS
a(19)-a(35) from Nathaniel Johnston, Apr 06 2011
More terms from Bert Dobbelaere, Apr 09 2021
STATUS
approved

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 May 27 02:27 EDT 2024. Contains 372847 sequences. (Running on oeis4.)