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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121289 a(n) = n/(largest triangular number dividing n). 0
0, 1, 2, 1, 4, 5, 1, 7, 8, 3, 1, 11, 2, 13, 14, 1, 16, 17, 3, 19, 2, 1, 22, 23, 4, 25, 26, 9, 1, 29, 2, 31, 32, 11, 34, 35, 1, 37, 38, 13, 4, 41, 2, 43, 44, 1, 46, 47, 8, 49, 5, 17, 52, 53, 9, 1, 2, 19, 58, 59, 4, 61, 62, 3, 64, 65, 1, 67, 68, 23, 7, 71, 2, 73, 74, 5, 76, 77, 1, 79, 8, 27, 82 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

a(n) = n/(A115017(n))

MATHEMATICA

f[n_] := Max[Select[Divisors[n], IntegerQ[(8# + 1)^(1/2)] & ]]; Table[n/f[n], {n, 0, 82}] (*Chandler*)

CROSSREFS

Cf. A000217, A083312, A115017.

Sequence in context: A124959 A081281 A108198 * A134248 A080935 A102661

Adjacent sequences:  A121286 A121287 A121288 * A121290 A121291 A121292

KEYWORD

nonn

AUTHOR

Leroy Quet Aug 24 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 29 2006

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

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

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.