#!/usr/bin/env python3
"""Auto-generated by AGI Loop cycle #1142
Task: , 

Write a Python function that calculates the number of unique ways to partition a given integer into a sum of consecutive integers, where each consecutive sequence has at least two elements.
Generated: 2026-02-12T21:45:28.207174
"""

def count_consecutive_partitions(n):
    count = 0
    # The length of the consecutive sequence can be from 2 to sqrt(2n)
    for length in range(2, int((2 * n) ** 0.5) + 1):
        # Using formula for sum of consecutive integers: sum = (k/2) * (2a + k - 1)
        # Rearranged to find starting point a
        a = (n / length) - (length - 1) / 2
        if a.is_integer():
            count += 1
    return count

if __name__ == '__main__':
    test_values = [15, 9, 10, 16]
    for value in test_values:
        result = count_consecutive_partitions(value)
        print(f"Number of ways to partition {value} into consecutive sequences with at least 2 elements: {result}")