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!)
A244504 Number of distinct lines passing through at least two points in a triangular grid of side n. 2
3, 9, 24, 51, 102, 177, 294, 459, 690, 987, 1380, 1875, 2508, 3279, 4212, 5319, 6648, 8199, 10026, 12141, 14580, 17343, 20496, 24051, 28068, 32547, 37542, 43071, 49218, 55983, 63456, 71661, 80658, 90447, 101100, 112635, 125160, 138675, 153252, 168915, 185784 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
LINKS
FORMULA
a(n) = 3*sum(j = 1..n-1, euler_phi(j)*(g(n-j)-g(n-2*j))), where g(i) = i*(i+1)/2 if i > 0, otherwise 0, after Jon E. Schoenfield.
MATHEMATICA
g[i_]:=If[i>0, i*(i+1)/2, 0]; Table[3*Sum[EulerPhi[j]*(g[n-j]-g[n-2*j]), {j, 1, n-1}], {n, 2, 50}] (* Vaclav Kotesovec, Sep 04 2014 after Jon E. Schoenfield *)
PROG
(PARI) g(j) = if (j > 0, j*(j+1)/2, 0);
a(n) = 3*sum(j = 1, n-1, eulerphi(j)*(g(n-j)-g(n-2*j))); \\ Michel Marcus, Sep 04 2014
CROSSREFS
Cf. A234248.
Sequence in context: A029530 A301740 A227018 * A085739 A245762 A291706
KEYWORD
nonn
AUTHOR
Heinrich Ludwig, Sep 04 2014
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 23 07:42 EDT 2024. Contains 371905 sequences. (Running on oeis4.)