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!)
A205109 The number s(j) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists, and s(j)=3^j-2^j. 2

%I #8 Mar 30 2012 18:58:10

%S 1,1,1,1,5,1,5,1,1,5,5,5,5,5,5,1,19,1,19,5,1,5,19,19,65,5,1,211,5,5,

%T 2059,1,5,19,1,5,5,19,65,65,665,1,19171,5,5,19,665,19,1,65,19,65,

%U 175099,1,5,211,19,5,211,5

%N The number s(j) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists, and s(j)=3^j-2^j.

%C For a guide to related sequences, see A204892.

%t (See the program at A205000.)

%Y Cf. A205000, A204892.

%K nonn

%O 1,5

%A _Clark Kimberling_, Jan 22 2012

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 April 24 06:39 EDT 2024. Contains 371920 sequences. (Running on oeis4.)