The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A205007 a(n) = (1/n)*A205006(n), where A205006(n) = s(k)-s(j), with (s(k),s(j)) the least pair of distinct triangular numbers for which n divides their difference. 6
 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For a guide to related sequences, see A204892. LINKS Antti Karttunen, Table of n, a(n) for n = 1..23515 MATHEMATICA (See the program at A205002.) PROG (PARI) A205007(n) = for(k=2, oo, my(sk=binomial(k+1, 2)); for(j=1, k-1, if(!((sk-binomial(j+1, 2))%n), return((sk-binomial(j+1, 2))/n)))); \\ Antti Karttunen, Sep 27 2018 CROSSREFS Cf. A000217, A205002, A205006, A204892. Cf. A318894 (gives the positions terms larger than one). Sequence in context: A030346 A030336 A321650 * A078470 A230799 A279496 Adjacent sequences: A205004 A205005 A205006 * A205008 A205009 A205010 KEYWORD nonn AUTHOR Clark Kimberling, Jan 21 2012 EXTENSIONS More terms from Antti Karttunen, Sep 27 2018 STATUS approved

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.

Last modified May 29 22:36 EDT 2024. Contains 372954 sequences. (Running on oeis4.)