A098849 -id:A098849 - cp's OEIS frontend

A132767 a(n) = n*(n + 25).

0, 26, 54, 84, 116, 150, 186, 224, 264, 306, 350, 396, 444, 494, 546, 600, 656, 714, 774, 836, 900, 966, 1034, 1104, 1176, 1250, 1326, 1404, 1484, 1566, 1650, 1736, 1824, 1914, 2006, 2100, 2196, 2294, 2394, 2496, 2600, 2706, 2814, 2924, 3036, 3150, 3266, 3384

Offset: 0

Omar E. Pol, Aug 28 2007

a(n) is the Zagreb 1 index of the Mycielskian of the cycle graph C[n]. See p. 205 of the D. B. West reference. - Emeric Deutsch, Nov 04 2016

Douglas B. West, Introduction to Graph Theory, 2nd ed., Prentice-Hall, NJ, 2001.

G. C. Greubel, Table of n, a(n) for n = 0..5000
Felix P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Wikipedia, Mycielskian.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566, A028569, A098603, A098847, A098848, A098849, A098850, A102928, A120071, A132759, A132760, A132761, A132762, A132763, A132764, A132765, A132766.

Table[n (n + 25), {n, 0, 50}] (* Bruno Berselli, Aug 22 2018 *)
LinearRecurrence[{3,-3,1},{0,26,54},60] (* Harvey P. Dale, Feb 20 2023 *)

a(n)=n*(n+25) \\ Charles R Greathouse IV, Jun 17 2017

[n*(n+25) for n in (0..50)] # G. C. Greubel, Mar 13 2022

a(n) = 2*n + a(n-1) + 24 (with a(0)=0). - Vincenzo Librandi, Aug 03 2010
a(n) = n^2 + 25*n. - Omar E. Pol, Nov 04 2016
From Chai Wah Wu, Dec 17 2016: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2.
G.f.: 2*x*(13 - 12*x)/(1-x)^3. (End)
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(25)/25 = A001008(25)/A102928(25) = 34052522467/223092870000, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/25 - 19081066231/669278610000. (End)
E.g.f.: x*(26 + x)*exp(x). - G. C. Greubel, Mar 13 2022

A098832 Square array read by antidiagonals: even-numbered rows of the table are of the form n(n+m) and odd-numbered rows are of the form n(n+m)/2.

Original entry on oeis.org

1, 3, 3, 6, 8, 2, 10, 15, 5, 5, 15, 24, 9, 12, 3, 21, 35, 14, 21, 7, 7, 28, 48, 20, 32, 12, 16, 4, 36, 63, 27, 45, 18, 27, 9, 9, 45, 80, 35, 60, 25, 40, 15, 20, 5, 55, 99, 44, 77, 33, 55, 22, 33, 11, 11, 66, 120, 54, 96, 42, 72, 30, 48, 18, 24, 6, 78, 143, 65, 117, 52, 91, 39, 65, 26, 39, 13, 13

Offset: 1

Eugene McDonnell (eemcd(AT)mac.com), Nov 02 2004

The rows of this table and that in A098737 are related. Given a function f = n/( 1 + (1+n) mod(2) ), row n of A098737 can be derived from row n of T by multiplying the latter by f(n); row n of T can be derived from row n of A098737 by dividing the latter by f(n).

			Array begins as:
  1,  3,  6, 10, 15, 21,  28,  36,  45 ... A000217;
  3,  8, 15, 24, 35, 48,  63,  80,  99 ... A005563;
  2,  5,  9, 14, 20, 27,  35,  44,  54 ... A000096;
  5, 12, 21, 32, 45, 60,  77,  96, 117 ... A028347;
  3,  7, 12, 18, 25, 33,  42,  52,  63 ... A027379;
  7, 16, 27, 40, 55, 72,  91, 112, 135 ... A028560;
  4,  9, 15, 22, 30, 39,  49,  60,  72 ... A055999;
  9, 20, 33, 48, 65, 84, 105, 128, 153 ... A028566;
  5, 11, 18, 26, 35, 45,  56,  68,  81 ... A056000;
Antidiagonals begin as:
   1;
   3,  3;
   6,  8,  2;
  10, 15,  5,  5;
  15, 24,  9, 12,  3;
  21, 35, 14, 21,  7,  7;
  28, 48, 20, 32, 12, 16,  4;
  36, 63, 27, 45, 18, 27,  9,  9;
  45, 80, 35, 60, 25, 40, 15, 20,  5;
  55, 99, 44, 77, 33, 55, 22, 33, 11, 11;

G. C. Greubel, Antidiagonals n = 1..50, flattened

Row m of array: A000217 (m=1), A005563 (m=2), A000096 (m=3), A028347 (m=4), A027379 (m=5), A028560 (m=6), A055999 (m=7), A028566 (m=8), A056000 (m=9), A098603 (m=10), A056115 (m=11), A098847 (m=12), A056119 (m=13), A098848 (m=14), A056121 (m=15), A098849 (m=16), A056126 (m=17), A098850 (m=18), A051942 (m=19).
Column m of array: A026741 (m=1), A022998 (m=2), A165351 (m=3).
Cf. A098737, A168509, A181900.

A098832:= func< n,k | (1/4)*(3+(-1)^k)*(n+1)*(n-k+1) >;
[A098832(n,k): k in [1..n], n in [1..15]]; // G. C. Greubel, Jul 31 2022

A098832[n_, k_]:= (1/4)*(3+(-1)^k)*(n+1)*(n-k+1);
Table[A098832[n,k], {n,15}, {k,n}]//Flatten (* G. C. Greubel, Jul 31 2022 *)

def A098832(n,k): return (1/4)*(3+(-1)^k)*(n+1)*(n-k+1)
flatten([[A098832(n,k) for k in (1..n)] for n in (1..15)]) # G. C. Greubel, Jul 31 2022

Item m of row n of T is given (in infix form) by: n T m = n * (n + m) / (1 + m (mod 2)). E.g. Item 4 of row 3 of T: 3 T 4 = 14.
From G. C. Greubel, Jul 31 2022: (Start)
A(n, k) = (1/4)*(3 + (-1)^n)*k*(k+n) (array).
T(n, k) = (1/4)*(3 + (-1)^k)*(n+1)*(n-k+1) (antidiagonal triangle).
Sum_{k=1..n} T(n, k) = (1/8)*(n+1)*( (3*n-1)*(n+1) + (1+(-1)^n)/2 ).
T(2*n-1, n) = A181900(n).
T(2*n+1, n) = 2*A168509(n+1). (End)

Missing terms added by G. C. Greubel, Jul 31 2022

A132768 a(n) = n*(n + 26).

Original entry on oeis.org

0, 27, 56, 87, 120, 155, 192, 231, 272, 315, 360, 407, 456, 507, 560, 615, 672, 731, 792, 855, 920, 987, 1056, 1127, 1200, 1275, 1352, 1431, 1512, 1595, 1680, 1767, 1856, 1947, 2040, 2135, 2232, 2331, 2432, 2535, 2640, 2747, 2856, 2967, 3080, 3195, 3312, 3431

Offset: 0

Omar E. Pol, Aug 28 2007

G. C. Greubel, Table of n, a(n) for n = 0..5000
Felix P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566, A028569.
Cf. A098849, A098850, A098603, A098847, A098848, A102928, A120071, A132759, A132760, A132761.
Cf. A132762, A132763, A132764, A132765, A132766, A132767.

Table[n(n+26),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,27,56},50] (* Harvey P. Dale, Dec 15 2018 *)

a(n)=n*(n+26) \\ Charles R Greathouse IV, Jun 17 2017

[n*(n+26) for n in (0..50)] # G. C. Greubel, Mar 13 2022

a(n) = n*(n + 26).
a(n) = 2*n + a(n-1) + 25, with a(0)=0. - Vincenzo Librandi, Aug 03 2010
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(26)/26 = A001008(26)/A102928(26) = 34395742267/232016584800, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 18051406831/696049754400. (End)
From G. C. Greubel, Mar 13 2022: (Start)
G.f.: x*(27 - 25*x)/(1-x)^3.
E.g.f.: x*(27 + x)*exp(x). (End)

A132769 a(n) = n*(n + 27).

Original entry on oeis.org

0, 28, 58, 90, 124, 160, 198, 238, 280, 324, 370, 418, 468, 520, 574, 630, 688, 748, 810, 874, 940, 1008, 1078, 1150, 1224, 1300, 1378, 1458, 1540, 1624, 1710, 1798, 1888, 1980, 2074, 2170, 2268, 2368, 2470, 2574, 2680, 2788, 2898, 3010, 3124, 3240, 3358, 3478

Offset: 0

Omar E. Pol, Aug 28 2007

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Felix P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566.
Cf. A028569, A098849, A098850, A098603, A098847, A098848, A102928, A120071, A132759.
Cf. A132760, A132761, A132762, A132763, A132764, A132765, A132766, A132767, A132768.
Cf. A132756.

Table[n(n+27),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,28,58},50] (* Harvey P. Dale, Oct 14 2012 *)

a(n)=n*(n+27) \\ Charles R Greathouse IV, Oct 07 2015

a(n) = 2*n + a(n-1) + 26, with a(0)=0. - Vincenzo Librandi, Aug 03 2010
a(0)=0, a(1)=28, a(2)=58; for n > 2, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Oct 14 2012
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(27)/27 = A001008(27)/A102928(27) = 312536252003/2168462696400, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/27 - 57128792093/2168462696400. (End)
From Elmo R. Oliveira, Nov 29 2024: (Start)
G.f.: 2*x*(14 - 13*x)/(1 - x)^3.
E.g.f.: exp(x)*x*(28 + x).
a(n) = 2*A132756(n). (End)

A105020 Array read by antidiagonals: row n (n >= 0) contains the numbers m^2 - n^2, m >= n+1.

Original entry on oeis.org

1, 3, 4, 5, 8, 9, 7, 12, 15, 16, 9, 16, 21, 24, 25, 11, 20, 27, 32, 35, 36, 13, 24, 33, 40, 45, 48, 49, 15, 28, 39, 48, 55, 60, 63, 64, 17, 32, 45, 56, 65, 72, 77, 80, 81, 19, 36, 51, 64, 75, 84, 91, 96, 99, 100, 21, 40, 57, 72, 85, 96, 105, 112, 117, 120, 121

Offset: 0

Andrew S. Plewe and Franklin T. Adams-Watters, Jul 11 2005

A "Goldbach Conjecture" for this sequence: when there are n terms between consecutive odd integers (2n+1) and (2n+3) for n > 0, at least one will be the product of 2 primes (not necessarily distinct). Example: n=3 for consecutive odd integers a(7)=7 and a(11)=9 and of the 3 sequence entries a(8)=12, a(9)=15 and a(10)=16 between them, one is the product of 2 primes a(9)=15=3*5. - Michael Hiebl, Jul 15 2007
A024352 gives distinct values in the array, minus the first row (1, 4, 9, 16, etc.). a(n) gives all solutions to the equation x^2 + xy = n, with y mod 2 = 0, x > 0, y >= 0. - Andrew S. Plewe, Oct 19 2007
Alternatively, triangular sequence of coefficients of Dynkin diagram weights for the Cartan groups C_n: t(n,m) = m*(2*n - m). Row sums are A002412. - Roger L. Bagula, Aug 05 2008

			Array begins:
  1  4  9 16 25 36  49  64  81 100 ...
  3  8 15 24 35 48  63  80  99 120 ...
  5 12 21 32 45 60  77  96 117 140 ...
  7 16 27 40 55 72  91 112 135 160 ...
  9 20 33 48 65 84 105 128 153 180 ...
  ...
Triangle begins:
   1;
   3,  4;
   5,  8,  9;
   7, 12, 15, 16;
   9, 16, 21, 24, 25;
  11, 20, 27, 32, 35, 36;
  13, 24, 33, 40, 45, 48, 49;
  15, 28, 39, 48, 55, 60, 63, 64;
  17, 32, 45, 56, 65, 72, 77, 80, 81;
  19, 36, 51, 64, 75, 84, 91, 96, 99, 100;

R. N. Cahn, Semi-Simple Lie Algebras and Their Representations, Dover, NY, 2006, ISBN 0-486-44999-8, p. 139.

G. C. Greubel, Antidiagonals n = 0..50, flattened

Rows give A000290, A005563, A028347, A028560, A028566, A098603, A098847, A098848, A098849, A098850.
Columns give A005408, A008586, A016945, A008590, A017329, A008594, A008598, A008602, A008606, A000567.
Diagonals give A033428, A045944, A067725.
Cf. A000384, A002412, A024352, A105020, A128076.

[(k+1)*(2*n-k+1): k in [0..n], n in [0..15]]; // G. C. Greubel, Mar 15 2023

t[n_, m_]:= (n^2 - m^2); Flatten[Table[t[i, j], {i,12}, {j,i-1,0,-1}]]
(* to view table *) Table[t[i, j], {j,0,6}, {i,j+1,10}]//TableForm (* Robert G. Wilson v, Jul 11 2005 *)
Table[(k+1)*(2*n-k+1), {n,0,15}, {k,0,n}]//Flatten (* Roger L. Bagula, Aug 05 2008 *)

def A105020(n,k): return (k+1)*(2*n-k+1)
flatten([[A105020(n,k) for k in range(n+1)] for n in range(16)]) # G. C. Greubel, Mar 15 2023

a(n) = r^2 - (r^2 + r - m)^2/4, where r = round(sqrt(m)) and m = 2*n+2. - Wesley Ivan Hurt, Sep 04 2021
a(n) = A128076(n+1) * A105020(n+1). - Wesley Ivan Hurt, Jan 07 2022
From G. C. Greubel, Mar 15 2023: (Start)
Sum_{k=0..n} T(n, k) = A002412(n+1).
Sum_{k=0..n} (-1)^k*T(n, k) = (1/2)*((1+(-1)^n)*A000384((n+2)/2) - (1- (-1)^n)*A000384((n+1)/2)). (End)

More terms from Robert G. Wilson v, Jul 11 2005

A132770 a(n) = n*(n + 28).

Original entry on oeis.org

0, 29, 60, 93, 128, 165, 204, 245, 288, 333, 380, 429, 480, 533, 588, 645, 704, 765, 828, 893, 960, 1029, 1100, 1173, 1248, 1325, 1404, 1485, 1568, 1653, 1740, 1829, 1920, 2013, 2108, 2205, 2304, 2405, 2508, 2613, 2720, 2829, 2940, 3053, 3168, 3285, 3404, 3525

Offset: 0

Omar E. Pol, Aug 28 2007

G. C. Greubel, Table of n, a(n) for n = 0..5000
Felix P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566, A028569.
Cf. A098603, A098847, A098848, A098849, A098850, A102928, A120071, A132759, A132760, A132761.
Cf. A132762, A132763, A132764, A132765, A132766, A132767, A132768, A132769.

#(#+28)&/@Range[0,50] (* or *) LinearRecurrence[{3,-3,1},{0,29,60},50] (* Harvey P. Dale, Apr 30 2018 *)

a(n)=n*(n+28) \\ Charles R Greathouse IV, Jun 17 2017

[n*(n+28) for n in (0..50)] # G. C. Greubel, Mar 13 2022

a(n) = 2*n + a(n-1) + 27, with a(0)=0. - Vincenzo Librandi, Aug 03 2010
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(28)/28 = A001008(28)/A102928(28) = 315404588903/2248776129600, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 7751493599/321253732800. (End)
G.f.: x*(29 - 27*x)/(1-x)^3. - Harvey P. Dale, Aug 03 2021
E.g.f.: x*(29 + x)*exp(x). - G. C. Greubel, Mar 13 2022

A132771 a(n) = n*(n + 29).

Original entry on oeis.org

0, 30, 62, 96, 132, 170, 210, 252, 296, 342, 390, 440, 492, 546, 602, 660, 720, 782, 846, 912, 980, 1050, 1122, 1196, 1272, 1350, 1430, 1512, 1596, 1682, 1770, 1860, 1952, 2046, 2142, 2240, 2340, 2442, 2546, 2652, 2760, 2870, 2982, 3096, 3212, 3330, 3450, 3572

Offset: 0

Omar E. Pol, Aug 28 2007

G. C. Greubel, Table of n, a(n) for n = 0..5000
Felix P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566, A028569.
Cf. A098849, A098850, A098603, A098847, A098848, A102928, A120071, A132759, A132760, A132761.
Cf. A132762, A132763, A132764, A132765, A132766, A132767, A132768, A132769, A132770.

Table[n(n+29), {n,0,50}] (* Bruno Berselli, Apr 03 2015 *)
LinearRecurrence[{3,-3,1},{0,30,62},50] (* Harvey P. Dale, Oct 18 2024 *)

a(n)=n*(n+29) \\ Charles R Greathouse IV, Jun 17 2017

[n*(n+29) for n in (0..50)] # G. C. Greubel, Mar 13 2022

a(n) = 2*n + a(n-1) + 28 (with a(0)=0). - Vincenzo Librandi, Aug 03 2010
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(29)/29 = A001008(29)/A102928(29) = 9227046511387/67543597321200, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/29 - 236266661971/9649085331600. (End)
From G. C. Greubel, Mar 13 2022: (Start)
G.f.: 2*(15*x - 14*x^2)/(1-x)^3.
E.g.f.: x*(30 + x)*exp(x). (End)

A132772 a(n) = n*(n + 30).

Original entry on oeis.org

0, 31, 64, 99, 136, 175, 216, 259, 304, 351, 400, 451, 504, 559, 616, 675, 736, 799, 864, 931, 1000, 1071, 1144, 1219, 1296, 1375, 1456, 1539, 1624, 1711, 1800, 1891, 1984, 2079, 2176, 2275, 2376, 2479, 2584, 2691, 2800, 2911, 3024, 3139, 3256, 3375, 3496, 3619

Offset: 0

Omar E. Pol, Aug 28 2007

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Felix P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566.
Cf. A028569, A067079, A098849, A098850, A098603, A098847, A098848, A102928, A120071.
Cf. A132759, A132760, A132761, A132762, A132763, A132764, A132765, A132766, A132767.
Cf. A132768, A132769, A132770, A132771.

Table[n(n+30),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,31,64},50] (* Harvey P. Dale, Mar 06 2015 *)

a(n)=n*(n+30) \\ Charles R Greathouse IV, Jun 17 2017

[n*(n+30) for n in (0..50)] # G. C. Greubel, Mar 13 2022

G.f.: x*(31-29*x)/(1-x)^3. - R. J. Mathar, Nov 14 2007
a(n) = 2*n + a(n-1) + 29 (with a(0)=0). - Vincenzo Librandi, Aug 03 2010
a(0)=0, a(1)=31, a(2)=64, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Mar 06 2015
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(30)/30 = A001008(30)/A102928(30) = 9304682830147/69872686884000, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 225175759291/9981812412000. (End)
E.g.f.: x*(31 + x)*exp(x). - G. C. Greubel, Mar 13 2022

A132773 a(n) = n*(n + 31).

Original entry on oeis.org

0, 32, 66, 102, 140, 180, 222, 266, 312, 360, 410, 462, 516, 572, 630, 690, 752, 816, 882, 950, 1020, 1092, 1166, 1242, 1320, 1400, 1482, 1566, 1652, 1740, 1830, 1922, 2016, 2112, 2210, 2310, 2412, 2516, 2622, 2730, 2840, 2952, 3066, 3182, 3300, 3420, 3542, 3666

Offset: 0

Omar E. Pol, Aug 28 2007

Felix P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566, A028569.
Cf. A098603, A098847, A098848, A098849, A098850, A102928, A120071, A132758, A132759, A132760.
Cf. A132761, A132762, A132763, A132764, A132765, A132766, A132767, A132768, A132769, A132770.
Cf. A132771, A132772.

Table[n*(n + 31), {n, 0, 100}] (* Wesley Ivan Hurt, Apr 16 2024 *)

a(n)=n*(n+31) \\ Charles R Greathouse IV, Jun 17 2017

G.f.: 2*x*(-16+15*x)/(-1+x)^3. - R. J. Mathar, Nov 14 2007
a(n) = 2*A132758(n). - R. J. Mathar, Jul 22 2009
a(n) = 2*n + a(n-1) + 30, with n > 0, a(0)=0. - Vincenzo Librandi, Aug 03 2010
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(31)/31 = A001008(31)/A102928(31) = 290774257297357/2238255069850800, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/31 - 7313175618421/319750724264400. (End)
From Elmo R. Oliveira, Dec 13 2024: (Start)
E.g.f.: exp(x)*x*(32 + x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

A348762 a(n) = A000265((n-8)*(n+8)).

Original entry on oeis.org

17, 9, 57, 5, 105, 33, 161, 3, 225, 65, 297, 21, 377, 105, 465, 1, 561, 153, 665, 45, 777, 209, 897, 15, 1025, 273, 1161, 77, 1305, 345, 1457, 3, 1617, 425, 1785, 117, 1961, 513, 2145, 35, 2337, 609, 2537, 165, 2745, 713, 2961, 3, 3185, 825, 3417, 221, 3657

Offset: 9

Simon Strandgaard, Oct 31 2021

nonn

Shares 495 initial terms with A061049. First difference is A061049(504)=62 vs. a(504)=31.

			a( 9) = A000265(( 9-8)*( 9+8)) = A000265( 17) = 17,
a(10) = A000265((10-8)*(10+8)) = A000265( 36) = 9,
a(11) = A000265((11-8)*(11+8)) = A000265( 57) = 57,
a(12) = A000265((12-8)*(12+8)) = A000265( 80) = 5,
a(13) = A000265((13-8)*(13+8)) = A000265(105) = 105.

Cf. A061049, A069834, A000265, A098849.

a[n_] := (n - 8)*(n + 8)/2^IntegerExponent[(n - 8)*(n + 8), 2]; Array[a, 53, 9] (* Amiram Eldar, Nov 22 2021 *)

A000265(n) = n >> valuation(n, 2);
a(n) = A000265((n-8)*(n+8));
[a(n)|n<-[9..27]]

def A348762(n):
    a, b = divmod(n*n-64, 2)
    while b == 0:
        a, b = divmod(a,2)
    return 2*a+b # Chai Wah Wu, Dec 05 2021

p (9..27).map { |n| x = (n-8)*(n+8); x /= 2 while x.even?; x }

a(n) = A000265(A098849(n-8)).

cp's OEIS Frontend

A132767 a(n) = n*(n + 25).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Sage

Formula

A098832 Square array read by antidiagonals: even-numbered rows of the table are of the form n*(n+m) and odd-numbered rows are of the form n*(n+m)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

Extensions

A132768 a(n) = n*(n + 26).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Sage

Formula

A132769 a(n) = n*(n + 27).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A105020 Array read by antidiagonals: row n (n >= 0) contains the numbers m^2 - n^2, m >= n+1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

Extensions

A132770 a(n) = n*(n + 28).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Sage

Formula

A132771 a(n) = n*(n + 29).

Views

Author

Keywords

Links

A098832 Square array read by antidiagonals: even-numbered rows of the table are of the form n(n+m) and odd-numbered rows are of the form n(n+m)/2.