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!)

Revision History for A205130

(Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A205130 Least k such that n divides s(k)-s(j) for some j satisfying 1<=j<k, where s(j)=2*j^2-j, the j-th hexagonal number.
(history; published version)
#9 by Michel Marcus at Thu Apr 09 14:21:03 EDT 2015
STATUS

reviewed

approved

#8 by Joerg Arndt at Thu Apr 09 14:06:46 EDT 2015
STATUS

proposed

reviewed

#7 by Danny Rorabaugh at Thu Apr 09 14:05:59 EDT 2015
STATUS

editing

proposed

#6 by Danny Rorabaugh at Thu Apr 09 14:05:28 EDT 2015
NAME

Least k such that n divides s(k)-s(j) for some j satisfying 1<=j<k, where s(j)=2*j^2-j, the jthj-th hexagonal number.

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 18:58:10 EDT 2012
AUTHOR

_Clark Kimberling (ck6(AT)evansville.edu), _, Jan 25 2012

Discussion
Fri Mar 30 18:58
OEIS Server: https://oeis.org/edit/global/285
#4 by T. D. Noe at Wed Jan 25 18:24:33 EST 2012
STATUS

proposed

approved

#3 by Clark Kimberling at Wed Jan 25 18:02:07 EST 2012
STATUS

editing

proposed

#2 by Clark Kimberling at Wed Jan 25 14:33:11 EST 2012
NAME

allocatedLeast k such that n divides s(k)-s(j) for some j satisfying 1<=j<k, where s(j)=2*j^2-j, the jth Clarkhexagonal Kimberlingnumber.

DATA

2, 3, 3, 5, 2, 5, 3, 9, 3, 5, 4, 6, 4, 3, 5, 17, 5, 7, 6, 6, 6, 4, 7, 11, 7, 11, 4, 11, 8, 5, 9, 33, 9, 14, 8, 9, 10, 6, 5, 13, 11, 12, 12, 5, 7, 7, 13, 18, 9, 14, 6, 12, 14, 8, 11, 13, 8, 23, 16, 6

OFFSET

1,1

COMMENTS

See A204892 for a discussion and guide to related sequences.

MATHEMATICA

s[n_] := s[n] = 2 n^2 - n; z1 = 500; z2 = 60;

Table[s[n], {n, 1, 30}] (* A000384, hexagonal numbers *)

u[m_] := u[m] = Flatten[Table[s[k] - s[j], {k, 2, z1}, {j, 1, k - 1}]][[m]]

Table[u[m], {m, 1, z1}] (* A205128 *)

v[n_, h_] := v[n, h] = If[IntegerQ[u[h]/n], h, 0]

w[n_] := w[n] = Table[v[n, h], {h, 1, z1}]

d[n_] := d[n] = First[Delete[w[n], Position[w[n], 0]]]

Table[d[n], {n, 1, z2}] (* A205129 *)

k[n_] := k[n] = Floor[(3 + Sqrt[8 d[n] - 1])/2]

m[n_] := m[n] = Floor[(-1 + Sqrt[8 n - 7])/2]

j[n_] := j[n] = d[n] - m[d[n]] (m[d[n]] + 1)/2

Table[k[n], {n, 1, z2}] (* A205130 *)

Table[j[n], {n, 1, z2}] (* A205131 *)

Table[s[k[n]], {n, 1, z2}] (* A205132 *)

Table[s[j[n]], {n, 1, z2}] (* A205133 *)

Table[s[k[n]] - s[j[n]], {n, 1, z2}] (* A205134 *)

Table[(s[k[n]] - s[j[n]])/n, {n, 1, z2}] (* A205135 *)

CROSSREFS

Cf. A000384, A204892, A205135.

KEYWORD

allocated

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Jan 25 2012

STATUS

approved

editing

#1 by Clark Kimberling at Sun Jan 22 10:30:44 EST 2012
NAME

allocated for Clark Kimberling

KEYWORD

allocated

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 12 23:29 EDT 2024. Contains 375855 sequences. (Running on oeis4.)