Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A146886
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A146886 A vector matrix Markov based on the prime-adic version of the modular group gamma matrix: S = {{0, -1}, {1, 0}}; T = {{1, 1}, {0, 1}}; m(0)=T.S m(n)=T^Prime[n].S.m(0); v(n)=M[n]*v(0). +0
1
1, 1, 2, 4, 6, 10, 12, 16, 18, 22, 28, 30, 36, 40, 42, 46, 52, 58, 60, 66, 70, 72, 78, 82, 88, 96, 100, 102, 106, 108, 112, 126, 130, 136, 138, 148, 150, 156, 162, 166, 172, 178, 180, 190, 192, 196, 198, 210, 222, 226, 228 (list; graph; listen)
OFFSET

0,3

COMMENT

Does a(n)=A039915(n) hold for n>=2 ? [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 05 2008]

REFERENCES

Weisstein, Eric W. "Modular Group Gamma." http : // mathworld.wolfram.com/ModularGroupGamma.html

FORMULA

S = {{0, -1}, {1, 0}}; T = {{1, 1}, {0, 1}}; m(n)=T^Prime[n].S.m(0); v(n)=M[n]*v(0); a(n)=v(n)[[1]].

MATHEMATICA

Clear[S, T, M, v, n] S = {{0, -1}, {1, 0}}; T = {{1, 1}, {0, 1}}; M[0] = T.S; M[n_] := M[n] = (MatrixPower[T, Prime[n]].S).M[0]; v[0] = {1, 0}; v[n_] := v[n] = M[n].v[0]; a = Table[v[n][[1]], {n, 0, 50}]

CROSSREFS

Sequence in context: A085477 A128984 A075728 this_sequence A006093 A127965 A117891

Adjacent sequences: A146883 A146884 A146885 this_sequence A146887 A146888 A146889

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 02 2008

page 1

Search completed in 0.004 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 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research