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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160275 Partition of positive numbers into shortest possible groups (1), (2,3), (4,5,6), (7,8), ... such that a(n) = the sum of the terms of the n-th group is a multiple of a(n-1). 3
1, 5, 15, 15, 30, 210, 1050, 6300, 1045800, 13756453200, 67826316310678800, 8622353329220210792550912000, 92206830102396929163916671718833533307592704000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(n) = A000217(A160277(n)) - A000217(A160277(n-1))

CROSSREFS

Cf. A160276 (ratios a(n)/a(n-1)), A160277 (last terms in the groups), A075631, A079798.

Sequence in context: A077348 A113259 A166621 * A200858 A184288 A015666

Adjacent sequences:  A160272 A160273 A160274 * A160276 A160277 A160278

KEYWORD

nonn

AUTHOR

Max Alekseyev (maxale(AT)gmail.com), May 08 2009

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 13 18:01 EST 2012. Contains 205532 sequences.