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!)
A083312 Largest integer m such that 1+2+...+m divides n. 3
1, 1, 2, 1, 1, 3, 1, 1, 2, 4, 1, 3, 1, 1, 5, 1, 1, 3, 1, 4, 6, 1, 1, 3, 1, 1, 2, 7, 1, 5, 1, 1, 2, 1, 1, 8, 1, 1, 2, 4, 1, 6, 1, 1, 9, 1, 1, 3, 1, 4, 2, 1, 1, 3, 10, 7, 2, 1, 1, 5, 1, 1, 6, 1, 1, 11, 1, 1, 2, 4, 1, 8, 1, 1, 5, 1, 1, 12, 1, 4, 2, 1, 1, 7, 1, 1, 2, 1, 1, 9, 13, 1, 2, 1, 1, 3, 1, 1, 2, 4, 1, 3, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
A dual to A011772.
LINKS
J. Sandor, Geometric Theorems, Diophantine Equations, Arithmetic Functions, American Research Press, 302 p., 2002.
EXAMPLE
ps(3) = 2 because 1+2 divides 3 and 2 is the largest such number.
ps(5) = 1 because 1 divides 5, while 1+2, 1+2+3 do not divide 5.
PROG
(PARI) a(n) = {m = 1; while ((t = m*(m+1)/2) <= n, if (n % t == 0, goodm = m); m ++; ); goodm; } \\ Michel Marcus, Aug 12 2013
CROSSREFS
Sequence in context: A175892 A010783 A306680 * A032435 A337798 A117502
KEYWORD
nonn
AUTHOR
K. Reddy (kakie(AT)indiainfo.com), Jun 03 2003
EXTENSIONS
More terms from Sam Alexander, Jan 03 2004
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 April 24 13:41 EDT 2024. Contains 371957 sequences. (Running on oeis4.)