|
Search: id:A060692
|
|
|
| A060692 |
|
Number of parts if 3^n is partitioned into parts of size 2^n as far as possible and into parts of size 1^n. |
|
+0
9
|
|
| 2, 3, 6, 6, 26, 36, 28, 186, 265, 738, 1105, 3186, 5269, 15516, 29728, 55761, 35228, 235278, 441475, 272526, 1861166, 3478866, 6231073, 1899171, 5672262, 50533341, 17325482, 186108951, 21328109, 63792576, 1264831925, 3794064336, 7086578554
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Corresponds to the only solution of the Diophantine equation 3^n = x*2^n + y*1^n with constraint 0 <= y < 2^n.
|
|
FORMULA
|
a(n) = A002379(n) + A002380(n) = floor(3^n/2^n) + (3^n mod 2^n)
|
|
EXAMPLE
|
3^4 = 81 = 16 + 16 + 16 + 16 + 16 + 1, so a(4) = 5 + 1 = 6; 3^5 = 243 = 32 + 32 + 32 + 32 + 32 + 32 + 32 + 19*1, so a(5) = 7 + 19 = 26.
|
|
PROGRAM
|
(PARI) {for(n=1, 33, d=divrem(3^n, 2^n); print1(d[1]+d[2], ", "))}
|
|
CROSSREFS
|
Cf. A002379, A002380, A064464, A064630.
Sequence in context: A089878 A057545 A015628 this_sequence A015698 A068587 A001058
Adjacent sequences: A060689 A060690 A060691 this_sequence A060693 A060694 A060695
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 20 2001
|
|
EXTENSIONS
|
Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 24 2003
|
|
|
Search completed in 0.002 seconds
|
