|
Search: id:A064855
|
|
|
| A064855 |
|
Mod[Mod[Mod[Mod[6^n, 5^n], 4^n], 3^n], 2^n]. |
|
+0
3
|
|
| 1, 2, 0, 14, 16, 10, 66, 21, 321, 917, 2037, 1550, 2420, 15152, 27439, 46731, 110953, 137148, 336949, 703202, 805647, 181132, 5835407, 3343039, 21816283, 18528238, 95129681, 241918238, 311938330, 48698222, 1539688558, 3481498150
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A generalization of A002380, A064536 and A064854. It arises also as a coefficient (=c1) of 1^n=1 in a special (greedy) decomposition of 6^n into like powers as follows: 6^n=c5*5^n+c4*4^n+c3*3^n+c2*2^n+c1*1^n.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,200
|
|
FORMULA
|
n = 8: 6^8 = 1679616 =4*[390625]+1*[65536]+7*[6561]+22*[256]+21*[1] where a(8)=21, the last coefficient and here 6^8 is decomposed into 4+1+7+22+21=55 like(8th) powers.
|
|
PROGRAM
|
(PARI) { for (n=1, 200, a=(((6^n%5^n)%4^n)%3^n)%2^n; write("b064855.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 28 2009]
|
|
CROSSREFS
|
Cf. A002380, A064536, A064854, A064855, A060692, A064628-A064631.
Sequence in context: A107700 A122688 A110685 this_sequence A088504 A074031 A086261
Adjacent sequences: A064852 A064853 A064854 this_sequence A064856 A064857 A064858
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 08 2001
|
|
|
Search completed in 0.002 seconds
|
