|
| |
|
|
A094200
|
|
a(n)=16*n^4+32*n^3+36*n^2+20*n+3.
|
|
2
| |
|
|
3, 107, 699, 2547, 6803, 15003, 29067, 51299, 84387, 131403, 195803, 281427, 392499, 533627, 709803, 926403, 1189187, 1504299, 1878267, 2318003, 2830803, 3424347, 4106699, 4886307, 5772003, 6773003, 7898907, 9159699, 10565747
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Let x(n)=(1/2)*(-(2*n+1)+sqrt((2*n+1)^2+4)) and f(k)=(-1)*sum(i=1,k,sum(j=1,i,(-1)^floor(j*x(n)))), then a(n)=k is the least integer k>0 such that f(k)=0.
|
|
|
REFERENCES
| B. Cloitre, On parity properties of certain Beatty sequences, in preparation 2004
|
|
|
PROG
| (PARI) a(n)=16*n^4+32*n^3+36*n^2+20*n+3
|
|
|
CROSSREFS
| Cf. A094201, A085005.
Sequence in context: A176807 A142509 A023325 * A003705 A146214 A061308
Adjacent sequences: A094197 A094198 A094199 * A094201 A094202 A094203
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), May 25 2004
|
| |
|
|
