|
| |
|
|
A045974
|
|
If m = p_i^e_i, n=Prod p_j^f_j, set G_m(n) = Prod p_{j+i}^{f_j*e_i}; extend G_m to all m by multiplicativity; sequence gives a(n)=G_n(n).
|
|
0
| |
|
|
1, 3, 7, 81, 13, 525, 19, 19683, 2401, 1911, 29, 354375, 37, 6897, 11011, 43046721, 43, 4501875, 53, 2528253, 22477, 14703, 61, 2152828125, 28561, 32079, 40353607, 22532499, 71, 40465425, 79, 847288609443, 58667, 46569, 71383, 75969140625, 89
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| From a puzzle proposed by Marc LeBrun (mlb(AT)well.com).
|
|
|
EXAMPLE
| G_2(6)=3*5, G_3(6)=5*7, so G_6(6)=3*5*5*7=525.
|
|
|
CROSSREFS
| Sequence in context: A116294 A077793 A175236 * A001531 A064118 A082715
Adjacent sequences: A045971 A045972 A045973 * A045975 A045976 A045977
|
|
|
KEYWORD
| nonn,nice,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Mar 14 2001
|
| |
|
|
