|
Search: id:A165453
|
|
|
| A165453 |
|
Linear interpolation of the sequence that maps an entry of A002378 to the corresponding entry of A006331 |
|
+0
1
|
|
| 0, 1, 2, 4, 6, 8, 10, 13, 16, 19, 22, 25, 28, 32, 36, 40, 44, 48, 52, 56, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 116, 122, 128, 134, 140, 146, 152, 158, 164, 170, 176, 182, 189, 196, 203, 210, 217, 224, 231, 238, 245, 252, 259, 266, 273, 280, 288, 296, 304
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a(0)=0, a(n) = max(min(a(n-1)+x, n+a(n-x))), where the maximum is taken over all values for x from 1 to n
|
|
MATHEMATICA
|
Clear[lst, n, a, f] f[n_]:=Round[Sqrt[n]]; a=0; lst={}; Do[AppendTo[lst, a+=f[n]], {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 13 2009]
|
|
CROSSREFS
|
Cf. A002378, A006331
Sequence in context: A130174 A061168 A130798 this_sequence A025224 A096182 A056827
Adjacent sequences: A165450 A165451 A165452 this_sequence A165454 A165455 A165456
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Friedrich Regen (friedrich.regen(AT)tu-ilmenau.de), Sep 20 2009
|
|
|
Search completed in 0.002 seconds
|
