Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117306
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117306 Numbers n such that the counts of 0's, 1's and 2's are the same in the ternary expansion of 2^n. +0
1
66, 227, 903, 17574, 40102 (list; graph; listen)
OFFSET

1,1

EXAMPLE

2^66 = {2, 0, 0, 0, 1, 2, 1, 2, 1, 0, 2, 1, 1, 2, 1, 0, 2, 1, 1, 2, 1, 0, 2, 1, 2, 2, 2, 1, 0, 0, 0, 2, 0, 0, 2, 0, 1, 0, 1, 2, 0, 1}

Count of 1 = count of 2 = count of 0 = 14, than 66 is member

MATHEMATICA

Do[If[DigitCount[2^n, 3, 0]==DigitCount[2^n, 3, 1]==DigitCount[2^n, 3, 2], Print[n]], {n, 1, 60000}]

CROSSREFS

Sequence in context: A044779 A074873 A046393 this_sequence A120102 A084027 A063249

Adjacent sequences: A117303 A117304 A117305 this_sequence A117307 A117308 A117309

KEYWORD

nonn

AUTHOR

Mohammed Bouayoun (Mohammed.bouayoun(AT)sanef.com), Apr 24 2006

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research