Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064235
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064235 Let A_n be the upper triangular matrix in the group GL(n,3) of invertible n X n matrices over GF(3) that has zero entries below the diagonal and 1 elsewhere. For example for n=4 the matrix is / 1,1,1,1 / 0,1,1,1 / 0,0,1,1 / 0,0,0,1 /. a(n) is the order of this matrix as an element of GL(n,3). +0
1
1, 3, 3, 9, 9, 9, 9, 9, 9, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81 (list; graph; listen)
OFFSET

1,2

COMMENT

For n>1 a(n) is the smallest integer such that gcd(a(n),2^a(n)+1)>=n - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 21 2002

FORMULA

a(n) the smallest power of 3 that is greater than or equal to n.

MAPLE

a := proc(n) option remember: if n=0 then RETURN(1) fi: 3*a(floor(n/3)); end: for n from 0 to 150 do printf(`%d, `, a(n)) od:

CROSSREFS

A062383.

Sequence in context: A065483 A019745 A155686 this_sequence A098355 A107443 A062234

Adjacent sequences: A064232 A064233 A064234 this_sequence A064236 A064237 A064238

KEYWORD

nonn

AUTHOR

Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Sep 22 2001

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Sep 26 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research