login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A351524 Number of powers of 11 modulo n. 3

%I #18 Feb 17 2022 19:12:34

%S 1,1,2,2,1,2,3,2,6,1,2,2,12,3,2,4,16,6,3,2,6,2,22,2,5,12,18,6,28,2,30,

%T 8,3,16,3,6,6,3,12,2,40,6,7,3,6,22,46,4,21,5,16,12,26,18,2,6,6,28,58,

%U 2,4,30,6,16,12,3,66,16,22,3,70,6,72,6,10,6,4,12,39,4,54,40,41,6,16,7,28

%N Number of powers of 11 modulo n.

%C This is the original version of A054711 rev. #1 as defined by _Henry Bottomley_, Apr 20 2000.

%C A054711 is now different from the sequence here.

%H Alois P. Heinz, <a href="/A351524/b351524.txt">Table of n, a(n) for n = 1..10000</a>

%Y Cf. A054711.

%Y Cf. A054703 (base 2), A054704 (3), A054705 (4), A054706 (5), A054707 (6), A054708 (7), A054709 (8), A054717 (9), A054710 (10), A054712 (12), A054713 (13), A054714 (14), A054715 (15), A054716 (16).

%K nonn,easy

%O 1,3

%A _Georg Fischer_, Feb 13 2022

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 17:30 EDT 2024. Contains 373653 sequences. (Running on oeis4.)