Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A205141 The number s(j) such that n divides s(k)-s(j), where s(j)=j*(3*j-1) and k is the least positive integer for which such a j exists. 2

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

%S 1,1,1,1,12,5,5,35,1,12,1,22,22,22,5,35,5,1,51,12,1,70,12,22,1,117,1,

%T 5,22,5,145,651,51,1,35,1,210,287,12,12,51,92,287,22,22,5,70,22,51,1,

%U 145,70,92,5,35,5,35,12,117,210

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

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

%t (See the program at A205138.)

%Y Cf. A205138, A204892.

%K nonn

%O 1,5

%A _Clark Kimberling_, Jan 25 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 September 12 23:00 EDT 2024. Contains 375855 sequences. (Running on oeis4.)