|
Search: id:A120867
|
|
|
| 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. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The j's that match these k's comprise A120866.
|
|
REFERENCES
|
C. Kimberling, The equation (j+k+1)^2-4k=Q*n^2 and related dispersions, preprint.
|
|
FORMULA
|
a(n)=-5*n^2+[1+n*sqrt(5)]^2, where [ ]=Floor.
|
|
EXAMPLE
|
4=-5*1+[1+sqrt(5)]^2,
5=-5*4+[1+2*sqrt(5)]^2,
4=-5*9+[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.
|
|
CROSSREFS
|
Cf. A120866.
Adjacent sequences: A120864 A120865 A120866 this_sequence A120868 A120869 A120870
Sequence in context: A020503 A071992 A092141 this_sequence A011427 A071413 A016717
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Jul 09 2006
|
|
|
Search completed in 0.002 seconds
|
