login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226787 If n=0 (mod 3) then a(n)=0, otherwise a(n)=9^(-1) in Z/nZ*. 7
0, 1, 0, 1, 4, 0, 4, 1, 0, 9, 5, 0, 3, 11, 0, 9, 2, 0, 17, 9, 0, 5, 18, 0, 14, 3, 0, 25, 13, 0, 7, 25, 0, 19, 4, 0, 33, 17, 0, 9, 32, 0, 24, 5, 0, 41, 21, 0, 11, 39, 0, 29, 6, 0, 49, 25, 0, 13, 46, 0, 34, 7, 0, 57, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

FORMULA

Empirical g.f.: -x^2*(x^17-x^14-3*x^12-x^11-3*x^9-9*x^8-x^6-4*x^5-4*x^3-x^2-1) / (x^18 -2*x^9 +1). - Colin Barker, Jun 20 2013

MATHEMATICA

Inv[a_, mod_] := Which[mod == 1, 0, GCD[a, mod] > 1, 0, True, Last@Reduce[a*x == 1, x, Modulus -> mod]]; Table[Inv[9, n], {n, 1, 122}]

PROG

(PARI) a(n)=if(n%3, lift(Mod(1, n)/9), 0) \\ Charles R Greathouse IV, Jun 18 2013

CROSSREFS

Cf. A092092, A226782-A226786.

Sequence in context: A137660 A123583 A236112 * A140574 A010636 A222302

Adjacent sequences:  A226784 A226785 A226786 * A226788 A226789 A226790

KEYWORD

nonn,easy

AUTHOR

José María Grau Ribas, Jun 18 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 27 18:22 EST 2020. Contains 338683 sequences. (Running on oeis4.)