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!)
A120867 a(n) is the number k for which there exists a unique pair (j,k) of positive integers such that (j + k + 1)^2 - 4*k = 20*n^2. 3
4, 5, 4, 1, 19, 16, 11, 4, 36, 29, 20, 9, 55, 44, 31, 16, 76, 61, 44, 25, 4, 80, 59, 36, 11, 101, 76, 49, 20, 124, 95, 64, 31, 149, 116, 81, 44, 5, 139, 100, 59, 16, 164, 121, 76, 29, 191, 144, 95, 44, 220, 169, 116, 61, 4, 196, 139, 80, 19, 225, 164, 101, 36, 256, 191 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The j's that match these k's comprise A120866.
LINKS
Clark Kimberling, The equation (j+k+1)^2-4*k = Q*n^2 and related dispersions, Journal of Integer Sequences, 10 (2007), Article #07.2.7.
FORMULA
a(n) = -5*n^2 + floor(1 + n*sqrt(5))^2.
EXAMPLE
4 = -5*1 + floor(1 + sqrt(5))^2,
5 = -5*4 + floor(1 + 2*sqrt(5))^2,
4 = -5*9 + floor(1 + 3*sqrt(5))^2, etc.
Moreover,
for n = 1, the unique (j,k) is (1,4): (1 + 4 + 1)^2 - 4*4 = 20*1;
for n = 2, the unique (j,k) is (4,5): (4 + 5 + 1)^2 - 4*5 = 20*4;
for n = 3, the unique (j,k) is (9,4): (9 + 4 + 1)^2 - 4*4 = 20*9.
PROG
(Magma) [-5*n^2+Floor(1+n*Sqrt(5))^2: n in [1..70]]; // Vincenzo Librandi, Sep 13 2011
CROSSREFS
Cf. A120866.
Sequence in context: A322193 A174984 A092141 * A011427 A366610 A175622
KEYWORD
nonn
AUTHOR
Clark Kimberling, Jul 09 2006
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 April 19 16:38 EDT 2024. Contains 371794 sequences. (Running on oeis4.)