

A088043


Number of partitions of n into parts which can be arranged to form a geometric progression (possibly with a common ratio of 1). (For every partition there exists a geometric progression in which this partition fits in as successive terms.).


0



1, 2, 3, 4, 3, 6, 4, 6, 5, 6, 3, 10, 4, 7, 8, 8, 3, 10, 3, 10, 9, 6, 3, 14, 5, 7, 7, 11, 3, 15, 5, 10, 7, 6, 8, 16, 3, 6, 8, 15, 3, 16, 4, 10, 12, 6, 3, 18, 6, 10, 7, 11, 3, 14, 7, 15, 8, 6, 3, 23, 3, 8, 14, 12, 8, 14, 3, 10, 7, 15, 3, 22, 4, 6, 12, 10, 8, 15, 3, 19, 9, 6, 3, 24, 8, 7, 7, 14, 3, 23
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Table of n, a(n) for n=1..90.


EXAMPLE

a(15) = 8 and the partitions are (15), (5, 5, 5), (3, 3, 3, 3, 3), (1, 1, ...15 times), (1, 2, 4, 8), (5, 10), (1, 14), (3, 12).
a(31) = 5 and the partitions are (31), (1+1...,31 times), (1,5,25),(1,2,4,8,16), (1,30).


PROG

(PARI) lim = 100; A = vector(lim, i, 1); for (r = 1, lim  1, s = r + 1; while (s <= lim, forstep (k = s, lim, s, A[k]++); s = r*s + 1)); A (Wasserman)


CROSSREFS

Cf. A049988.
Sequence in context: A097272 A126630 A167234 * A332931 A248376 A138796
Adjacent sequences: A088040 A088041 A088042 * A088044 A088045 A088046


KEYWORD

nonn


AUTHOR

Amarnath Murthy, Sep 20 2003


EXTENSIONS

More terms from David Wasserman, Jun 21 2005


STATUS

approved



