|
Search: id:A088003
|
|
|
| A088003 |
|
Take the list t[n,0]={1,...,n}; denote by t[n,j] this list after rotating to left[or right] by j positions. Calculate inner product of t[n,0] and t[n,j] and denote the value by s[n,j]. Compute this inner product for all j=1,..,n and choose the smallest. This is a[n]. |
|
+0
3
|
|
| 1, 4, 11, 22, 40, 64, 98, 140, 195, 260, 341, 434, 546, 672, 820, 984, 1173, 1380, 1615, 1870, 2156, 2464, 2806, 3172, 3575, 4004, 4473, 4970, 5510, 6080, 6696, 7344, 8041, 8772, 9555, 10374, 11248, 12160, 13130, 14140, 15211, 16324, 17501, 18722, 20010
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
If instead of Min the Max was computed, then A000330[n], the square pzramidal numbers was obtained. Also, inner product of t with 1-rotated-t is calculated, then A006527[n] is produced.
|
|
FORMULA
|
a[n]=Min{y; y=t[n, 0]*t[n, x]=s[n, x]; for x=1, .., n}
n/48 * [10n^2 + 24n + 11 - 3(-1)^n].
|
|
EXAMPLE
|
n=6: t[6,0]={1,2,3,4,5,6}, t[6,3]={4,5,6,1,2,3};
compute scalar products for all rotations:
{76,67,64,67,76,91} of which smallest is 64, so a[6]=64.
|
|
MATHEMATICA
|
t0[x_] := Table[w, {w, 1, x}]; jr[x_, j_] := RotateRight[t0[x], j]; Table[Min[Table[Apply[Plus, t0[g]*jr[g, i]], {i, 1, g}]], {g, 1, up}]
|
|
CROSSREFS
|
Cf. A000330, A006527.
Cf. A094414.
Sequence in context: A132072 A009846 A008043 this_sequence A049836 A008016 A008249
Adjacent sequences: A088000 A088001 A088002 this_sequence A088004 A088005 A088006
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 14 2003
|
|
|
Search completed in 0.002 seconds
|
