|
Search: id:A033676
|
|
|
| A033676 |
|
Largest divisor of n <= sqrt(n). |
|
+0
41
|
|
| 1, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 3, 1, 2, 3, 4, 1, 3, 1, 4, 3, 2, 1, 4, 5, 2, 3, 4, 1, 5, 1, 4, 3, 2, 5, 6, 1, 2, 3, 5, 1, 6, 1, 4, 5, 2, 1, 6, 7, 5, 3, 4, 1, 6, 5, 7, 3, 2, 1, 6, 1, 2, 7, 8, 5, 6, 1, 4, 3, 7, 1, 8, 1, 2, 5, 4, 7, 6, 1, 8, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Contribution from Omar E. Pol (info(AT)polprimos.com), Jul 05 2009: (Start)
Values ... Sequence
.. 1 ..... A008578 (1 together with the prime numbers)
.. 2 ..... A161344
.. 3 ..... A161345
.. 4 ..... A161424
.. 5 ..... A161835
.. 6 ..... A162526
.. 7 ..... A162527
.. 8 ..... A162528
.. 9 ..... A162529
. 10 ..... A162530
. 11 ..... A162531
. 12 ..... A162532
(End)
a(n) = sqrt(n) is a new record iff n is a square. [From Zak Seidov (zakseidov(AT)yahoo.com), Jul 17 2009]
|
|
REFERENCES
|
G. Tenenbaum, pp. 268ff of R. L. Graham et al., eds., Mathematics of Paul Erdos I.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
O. E. Pol, Illustration: Divisors and pi(x) [From Omar E. Pol (info(AT)polprimos.com), Jul 05 2009]
|
|
MAPLE
|
A033676 := proc(n) local a, d; a := 0 ; for d in numtheory[divisors](n) do if d^2 <= n then a := max(a, d) ; fi; od: a; end: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 09 2009]
|
|
CROSSREFS
|
A033677(n) * a(n) = n
Cf. A008578, A161344, A161345, A161424, A161835, A162526, A162527, A162528, A162529, A162530, A162531, A162532. [From Omar E. Pol (info(AT)polprimos.com), Jul 05 2009]
Sequence in context: A072203 A124044 A059981 this_sequence A095165 A046805 A034880
Adjacent sequences: A033673 A033674 A033675 this_sequence A033677 A033678 A033679
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Typos in A-numbers corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 13 2009
|
|
|
Search completed in 0.003 seconds
|
