Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064536
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064536 Mod[Mod[4^n,3^n],2^n]. +0
3
1, 3, 2, 13, 20, 3, 51, 87, 121, 711, 1139, 3537, 8034, 15752, 27922, 49629, 33201, 35975, 143900, 136341, 545364, 2181456, 1060135, 4240540, 16962160, 28647197, 13597858, 205877827, 100616667, 381266393, 1397863922, 3825576990 (list; graph; listen)
OFFSET

1,2

COMMENT

A generalization of A002380. It arises also as a coefficient (=c1) of 1^n=1 in a special (greedy) decomposition of 4^n into like powers as follows: 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 = 7: 4^7 = 16384 = 7*[2187] + 8*[128] + 51*[1] where a(7)=51, the last coefficient; A064630[7]=7+8+a(7)=66.

PROGRAM

(PARI) { for (n=1, 200, write("b064536.txt", n, " ", (4^n % 3^n) % 2^n) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 17 2009]

CROSSREFS

Cf. A002380, A064853-A064855, A060692, A064628-A064631.

Sequence in context: A060149 A059374 A098384 this_sequence A163355 A145747 A055234

Adjacent sequences: A064533 A064534 A064535 this_sequence A064537 A064538 A064539

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 08 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research