A017353 -id:A017353 - cp's OEIS frontend

A030432 Primes of form 10n+7.

7, 17, 37, 47, 67, 97, 107, 127, 137, 157, 167, 197, 227, 257, 277, 307, 317, 337, 347, 367, 397, 457, 467, 487, 547, 557, 577, 587, 607, 617, 647, 677, 727, 757, 787, 797, 827, 857, 877, 887, 907, 937, 947, 967, 977, 997, 1087, 1097, 1117, 1187, 1217, 1237

Offset: 1

Warut Roonguthai

Union of A132231 and A039949. - Ray Chandler, Apr 07 2009
5 is not quadratic residue of primes of this form. - Vincenzo Librandi, Jun 25 2014
Also primes of the form 5n+2 with positive n. - Danny Rorabaugh, Feb 20 2016
Intersection of A000040 and A017353. - Iain Fox, Dec 30 2017

Michael B. Porter, Table of n, a(n) for n = 1..100000
A. Granville and G. Martin, Prime number races, arXiv:math/0408319 [math.NT], 2004.

Cf. A030430 (10n+1), A030431 (10n+3), A030433 (10n+9).

Cf. A045357, A045380, A049509, A102342.

[n: n in [7..1240 by 10] | IsPrime(n)]; // Bruno Berselli, Apr 06 2011

Select[Prime@Range[210], Mod[ #, 10] == 7 &] (* Ray Chandler, Nov 07 2006 *)

is(n)=n%10==7 && isprime(n) \\ Charles R Greathouse IV, Jul 01 2013

lista(nn) = forprime(p=7, nn, if(p%10==7, print1(p, ", "))) \\ Iain Fox, Dec 30 2017

[10*n+7 for n in range(124) if is_prime(10*n+7)] # Danny Rorabaugh, Feb 20 2016

a(n) = 10*A102342(n) + 7.

a(n) ~ 4n log n. - Charles R Greathouse IV, Jul 01 2013

Extended by Ray Chandler, Nov 07 2006

A106621 a(n) = numerator of n/(n+20).

Original entry on oeis.org

0, 1, 1, 3, 1, 1, 3, 7, 2, 9, 1, 11, 3, 13, 7, 3, 4, 17, 9, 19, 1, 21, 11, 23, 6, 5, 13, 27, 7, 29, 3, 31, 8, 33, 17, 7, 9, 37, 19, 39, 2, 41, 21, 43, 11, 9, 23, 47, 12, 49, 5, 51, 13, 53, 27, 11, 14, 57, 29, 59, 3, 61, 31, 63, 16, 13, 33, 67, 17, 69, 7, 71, 18, 73, 37, 15, 19, 77, 39, 79

Offset: 0

N. J. A. Sloane, May 15 2005

Contains as subsequences A026741, A017281, A017305, A005408, A017353, and A017377. - Luce ETIENNE, Nov 04 2018

Multiplicative and also a strong divisibility sequence: gcd(a(n),a(m)) = a(gcd(n,m)) for n, m >= 1. - Peter Bala, Feb 24 2019

Vincenzo Librandi, Table of n, a(n) for n = 0..2000
Peter Bala, A note on the sequence of numerators of a rational function, 2019.
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-1).

Cf. A000010, A010879.

Cf. Sequences given by the formula numerator(n/(n + k)): A026741 (k = 2), A051176 (k = 3), A060819 (k = 4), A060791 (k = 5), A060789 (k = 6), A106608 thru A106612 (k = 7 thru 11), A051724 (k = 12), A106614 thru A106620 (k = 13 thru 19).

List([0..80],n->NumeratorRat(n/(n+20))); # Muniru A Asiru, Feb 19 2019

[Numerator(n/(n+20)): n in [0..100]]; // Vincenzo Librandi, Mar 06 2018

seq(numer(n/(n+20)),n=0..80); # Muniru A Asiru, Feb 19 2019

f[n_]:=Numerator[n/(n+20)];Array[f,100,0] (* Vladimir Joseph Stephan Orlovsky, Feb 17 2011 *)

a(n) = numerator(n/(n+20)); \\ Michel Marcus, Mar 07 2018

[lcm(20,n)/20 for n in range(0, 80)] # Zerinvary Lajos, Jun 12 2009

a(n) = lcm(20, n)/20. - Zerinvary Lajos, Jun 12 2009
a(n) = n/gcd(n, 20). - Andrew Howroyd, Jul 25 2018
From Luce ETIENNE, Nov 04 2018: (Start)
a(n) = 9*a(n-20) - 36*a(n-40) + 84*a(n-60) - 126*a(n-80) + 126*a(n-100) - 84*a(n-120) + 36*a(n-140) - 9*a(n-160) + a(n-180).
a(n) = (5*(119*m^9 - 4923*m^8 + 86250*m^7 - 832230*m^6 + 4807887*m^5 - 16882299*m^4 + 34770400*m^3 - 37855620m^2 + 16581744*m + 54432)*floor(n/10) + 72*m*(3*m^8 - 120*m^7 + 2030*m^6 - 18900*m^5 + 105329*m^4 - 356580*m^3 + 706220*m^2 - 733200*m + 300258) + ((19*m^9 - 855*m^8 + 15810*m^7 - 154350*m^6 + 849387*m^5 - 2597175*m^4 + 4037840*m^3 - 2600100*m^2 + 540144*m - 90720)*floor(n/10) - 72*m*(m^7 - 35*m^6 + 490*m^5 - 3500*m^4 + 13489*m^3 - 27335*m^2 + 26340*m - 9450))*(-1)^floor(n/10))/362880 where m = (n mod 10). (End)
From Peter Bala, Feb 24 2019: (Start)
a(n) = n/gcd(n,20) is a quasi-polynomial in n since gcd(n,20) is a purely periodic sequence of period 20.
O.g.f.: F(x) - F(x^2) - F(x^4) - 4*F(x^5) + 4*F(x^10) + 4*F(x^20), where F(x) = x/(1 - x)^2.
O.g.f. for reciprocals: Sum_{n >= 1} x^n/a(n) = Sum_{d divides 20} (phi(d)/d) * log(1/(1 - x^d)) = log(1/(1 - x)) + (1/2)*log(1/(1 - x^2)) + (2/4)*log(1/(1 - x^4)) + (4/5)*log(1/(1 - x^5)) + (4/10)*log(1/(1 - x^10)) + (8/20)*log(1/(1 - x^20)), where phi(n) denotes the Euler totient function A000010. (End)
From Amiram Eldar, Nov 25 2022: (Start)
Multiplicative with a(2^e) = 2^max(0, e-2), a(5^e) = 5^max(0,e-1), and a(p^e) = p^e otherwise.
Dirichlet g.f.: zeta(s-1)*(1 - 1/2^s - 1/4^s - 4/5^s + 4/10^s + 4/20^s).
Sum_{k=1..n} a(k) ~ (231/800) * n^2. (End)

Keyword:mult added by Andrew Howroyd, Jul 25 2018

A063226 Dimension of the space of weight 2n cuspidal newforms for Gamma_0(63).

Original entry on oeis.org

3, 7, 13, 17, 23, 27, 33, 37, 43, 47, 53, 57, 63, 67, 73, 77, 83, 87, 93, 97, 103, 107, 113, 117, 123, 127, 133, 137, 143, 147, 153, 157, 163, 167, 173, 177, 183, 187, 193, 197, 203, 207, 213, 217, 223, 227, 233, 237, 243, 247

Offset: 1

N. J. A. Sloane, Jul 10 2001

Also, dimension of the space of weight 2n cuspidal newforms for Gamma_0(88). - N. J. A. Sloane, Nov 24 2016
First differences are 4,6,4,6,4,6.... Also  values of k such that k^(10*n) mod 10 = 8*(n mod 2)+1. - Gary Detlefs, Jul 04 2014
In other words, numbers n such that n^(2+4*k) + 1 is divisible by 10, for k >= 0. - Altug Alkan, Mar 30 2016
The rational generating function, the periodic first differences and Greubel's closed form are an immediate consequence of the structure of formula given by [Martin]. - R. J. Mathar, Apr 09 2016
A quasipolynomial of order 2 and degree 1: a(n) = 5n - 3 if n is even and 5n - 2 if n is odd. - Charles R Greathouse IV, Nov 03 2021
Numbers that are congruent to {3, 7} mod 10. - Amiram Eldar, Nov 23 2024

G. C. Greubel, Table of n, a(n) for n = 1..10000
Greg Martin, Dimensions of the spaces of cusp forms and newforms on Gamma_0(N) and Gamma_1(N), J. Numb. Theory 112 (2005) 298-331, Theorem 1.
William A. Stein, Dimensions of the spaces S_k^{new}(Gamma_0(N)).
William A. Stein, The modular forms database.
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A017305 (bisection), A017353 (bisection), A019934, A182007.

Maple
```
# see A063195
```

Table[4 Floor[n/2] + 6 Floor[(n - 1)/2] + 3, {n, 50}] (* or *)
Table[SeriesCoefficient[3 x - x^2 (-7 - 6 x + 3 x^2)/((1 + x) (x - 1)^2), {x, 0, n}], {n, 50}] (* Michael De Vlieger, Mar 30 2016 *)
LinearRecurrence[{1, 1, -1}, {3, 7, 13}, 100] (* G. C. Greubel, Mar 30 2016 *)

my(x='x+O('x^99)); Vec(3*x-x^2*(-7-6*x+3*x^2)/((1+x)*(x-1)^2)) \\ Altug Alkan, Mar 31 2016

a(n)=5*n-3+n%2 \\ Charles R Greathouse IV, Mar 31 2016

a(n) = 4*floor(n/2) + 6*floor((n-1)/2) + 3. - Gary Detlefs, Jul 04 2014
G.f.: 3*x - x^2*(-7-6*x+3*x^2)/((1+x)*(x-1)^2). - R. J. Mathar, Jul 15 2015
From G. C. Greubel, Mar 30 2016: (Start)
a(n) = (1/2)*(10*n - 5 - (-1)^n).
E.g.f.: (5*x + 3)*cosh(x) + (5*x + 2)*sinh(x). (End)
Sum_{n>=1} (-1)^(n+1)/a(n) = sqrt(5-2*sqrt(5))*Pi/10. - Amiram Eldar, Sep 26 2022
From Amiram Eldar, Nov 23 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = 2*sin(Pi/5) (A182007).
Product_{n>=1} (1 + (-1)^n/a(n)) = tan(Pi/5) (A019934). (End)

A260181 Numbers whose last digit is prime.

Original entry on oeis.org

2, 3, 5, 7, 12, 13, 15, 17, 22, 23, 25, 27, 32, 33, 35, 37, 42, 43, 45, 47, 52, 53, 55, 57, 62, 63, 65, 67, 72, 73, 75, 77, 82, 83, 85, 87, 92, 93, 95, 97, 102, 103, 105, 107, 112, 113, 115, 117, 122, 123, 125, 127, 132, 133, 135, 137, 142, 143, 145, 147

Offset: 1

Wesley Ivan Hurt, Jul 17 2015

Numbers ending in 2, 3, 5 or 7.
The subsequence of primes is A042993. - Michel Marcus, Jul 19 2015
From Wesley Ivan Hurt, Aug 15 2015, Sep 26 2015: (Start)
Ceiling(a(n)/2) = A047201(n).
Complement of (A197652 Union A262389). (End)

Muniru A Asiru, Table of n, a(n) for n = 1..5000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1).

Cf. A042993, A047201, A092620, subset of A118950.
Union of A017293, A017305, A017329 and A017353.
First differences are [1,2,2,5,...] = A002522(A140081(n-1)).
Cf. A197652, A262389.

a:=n->(5*n-4-(-1)^n+((3-(-1)^n)/2)*(-1)^((2*n+5-(-1)^n)/4))/2; List([1..60],n->a(n)); # Muniru A Asiru, Feb 16 2018

[(5*n-4-(-1)^n+((3-(-1)^n) div 2)*(-1)^((2*n+5-(-1)^n) div 4))/2: n in [1..70]]; // Vincenzo Librandi, Jul 18 2015

A260181:=n->(5*n-4-(-1)^n+((3-(-1)^n)/2)*(-1)^((2*n+5-(-1)^n)/4))/2: seq(A260181(n), n=1..100);

CoefficientList[Series[(2 + x + 2 x^2 + 2 x^3 + 3 x^4)/((x - 1)^2*(1 + x + x^2 + x^3)), {x, 0, 100}], x]
LinearRecurrence[{1, 0, 0, 1, -1}, {2, 3, 5, 7, 12}, 60] (* Vincenzo Librandi, Jul 18 2015 *)
Table[(5n - 4 - (-1)^n + ((3 - (-1)^n)/2)*(-1)^((2*n + 5 - (-1)^n)/4))/2, {n, 100}] (* Wesley Ivan Hurt, Aug 11 2015 *)

is(n)=my(m=digits(n));isprime(m[#m]) \\ Anders Hellström, Jul 19 2015

A260181(n)=(n--)\4*10+prime(n%4+1) \\ is(n)=isprime(n%10) is much more efficient than the above. - M. F. Hasler, Sep 16 2016

G.f.: x*(2+x+2*x^2+2*x^3+3*x^4) / ((x-1)^2*(1+x+x^2+x^3)).
a(n) = a(n-1)+a(n-4)-a(n-5), n>5.
a(n) = (5*n-4-(-1)^n+((3-(-1)^n)/2)*(-1)^((2*n+5-(-1)^n)/4))/2.
Sum_{n>=1} (-1)^(n+1)/a(n) = (2*sqrt(5*sqrt(5+2*sqrt(5))) - 25*log(5) - 40*log(2) + 5*sqrt(5)*arccoth(843/2))/200. - Amiram Eldar, Jul 30 2024

A355307 Carmichael numbers ending in 7.

Original entry on oeis.org

46657, 126217, 748657, 1569457, 4909177, 9613297, 11972017, 40160737, 55462177, 65037817, 106041937, 161035057, 178451857, 193910977, 196358977, 311388337, 328573477, 338740417, 358940737, 403043257, 461502097, 499310197, 556450777, 569332177, 633639097, 784966297, 902645857, 981789337, 1125038377

Offset: 1

Omar E. Pol, Jul 24 2022

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for sequences related to Carmichael numbers

Intersection of A002997 and A017353.

Cf. A352970, A354609, A355305, A355309.

Select[10*Range[0, 10^7] + 7, CompositeQ[#] && Divisible[# - 1, CarmichaelLambda[#]] &] (* Amiram Eldar, Jul 24 2022 *)

from itertools import count, islice
from sympy import factorint
def A355307_gen(): # generator of terms
    for n in count(7,10):
        f = factorint(n)
        if len(f) == sum(f.values()) > 1 and not any((n-1) % (p-1) for p in f):
            yield n
A355307_list = list(islice(A355307_gen(),5)) # Chai Wah Wu, Jul 25 2022

A152161 a(n) = 100n^2 + 100n + 21.

Original entry on oeis.org

21, 221, 621, 1221, 2021, 3021, 4221, 5621, 7221, 9021, 11021, 13221, 15621, 18221, 21021, 24021, 27221, 30621, 34221, 38021, 42021, 46221, 50621, 55221, 60021, 65021, 70221, 75621, 81221, 87021, 93021, 99221, 105621, 112221, 119021, 126021, 133221, 140621, 148221

Offset: 0

Paul Curtz, Nov 27 2008

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001622, A017305, A017353, A061037.

[(10*n+3)*(10*n+7): n in [0..40]]; // Vincenzo Librandi, Jul 28 2011

Table[100*n^2 + 100*n + 21, {n,0,50}] (* G. C. Greubel, Sep 20 2018 *)
LinearRecurrence[{3,-3,1},{21,221,621},40] (* Harvey P. Dale, Dec 06 2018 *)

a(n)=100*n*(n+1)+21 \\ Charles R Greathouse IV, Jul 28 2011

a(n) = A017305(n)*A017353(n) = A061037(10*n+3).
From Amiram Eldar, Feb 20 2023: (Start)
Sum_{n>=0} 1/a(n) = sqrt(5-2*sqrt(5))*Pi/40.
Sum_{n>=0} (-1)^n/a(n) = (sqrt(10-2*sqrt(5))*log(cot(Pi/20)) + sqrt(10+2*sqrt(5))*log(tan(3*Pi/20)))/40.
Product_{n>=0} (1 - 1/a(n)) = 2*cos(sqrt(5)*Pi/10)/phi, where phi is the golden ratio (A001622).
Product_{n>=0} (1 + 1/a(n)) = 2*cos(sqrt(3)*Pi/10)/phi. (End)
From Elmo R. Oliveira, Nov 27 2024: (Start)
G.f.: (21 + 158*x + 21*x^2)/(1-x)^3.
E.g.f.: (21 + 200*x + 100*x^2)*exp(x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n >= 3. (End)

A290972 Primes p such that the sum of the squares of digits of p equals the sum of digits of p^2.

Original entry on oeis.org

2, 3, 3331, 3433, 11243, 13241, 21523, 22153, 22531, 31541, 32141, 32411, 33203, 34033, 34141, 34211, 35141, 41341, 41413, 42131, 43411, 44131, 51341, 51413, 52321, 54311, 102253, 102523, 104231, 104513, 110543, 111263, 111623, 112163

Offset: 1

K. D. Bajpai, Aug 16 2017

214007 is the smallest term that is in A017353 and 31111009 is the smallest term that is in A017377. - Altug Alkan, Aug 16 2017

			a(3) = 3331 is prime: [3^2 + 3^2 + 3^2 + 1^2 = 9 + 9 + 9 + 1] = 28; [3331^2 = 11095561, 1 + 1 + 0 + 9 + 5 + 5 + 1] = 28.
a(5) = 11243 is prime: [1^2 + 1^2 + 2^2 + 4^2 + 3^2 = 1 + 1 + 4 + 16 + 9] = 31: [11243^2 = 126405049;1 + 2 + 6 + 4 + 0 + 5 + 0 + 4 + 9] = 31.

Robert Israel, Table of n, a(n) for n = 1..4000

Intersection of A000040 and A165550.

Cf. A123157.

filter:= t -> convert(map(`^`,convert(t,base,10),2),`+`) = convert(convert(t^2,base,10),`+`) and isprime(t):
select(filter, [2,seq(i,i=3..200000,2)]); # Robert Israel, Aug 16 2017

Select[Prime[Range[20000]], Plus @@ IntegerDigits[#^2] == Total[IntegerDigits[#]^2] &]

forprime(p=1, 30000, v=digits(p); if(sum(i=1, length(v), v[i]^2) == sumdigits(p^2), print1(p", ")));

A385623 Array read by ascending antidiagonals: A(n,k) is the number obtained by concatenation of n with k in that order, with k >= 0.

Original entry on oeis.org

0, 10, 1, 20, 11, 2, 30, 21, 12, 3, 40, 31, 22, 13, 4, 50, 41, 32, 23, 14, 5, 60, 51, 42, 33, 24, 15, 6, 70, 61, 52, 43, 34, 25, 16, 7, 80, 71, 62, 53, 44, 35, 26, 17, 8, 90, 81, 72, 63, 54, 45, 36, 27, 18, 9, 100, 91, 82, 73, 64, 55, 46, 37, 28, 19, 10, 110, 101, 92, 83, 74, 65, 56, 47, 38, 29, 110, 11

Offset: 0

Stefano Spezia, Jul 05 2025

			Array begins as:
   0,  1,  2,  3,  4,  5,  6,  7, ...
  10, 11, 12, 13, 14, 15, 16, 17, ...
  20, 21, 22, 23, 24, 25, 26, 27, ...
  30, 31, 32, 33, 34, 35, 36, 37, ...
  40, 41, 42, 43, 44, 45, 46, 47, ...
  50, 51, 52, 53, 54, 55, 56, 57, ...
  60, 61, 62, 63, 64, 65, 66, 67, ...
  ...

Stefano Spezia, Table of n, a(n) for n = 0..11475 (first 151 antidiagonals of the array, flattened)

Columns for k=0..9 give: A008592, A017281, A017293, A017305, A017317, A017329, A017341, A017353, A017365, A017377.

Cf. A001477 (1st row), A020338 (main diagonal), A055642, A385624 (antidiagonal sums).

A[n_,k_]:=FromDigits[Join[IntegerDigits[n],IntegerDigits[k]]]; Table[A[n,k],{n,0,6},{k,0,7}] (* or *)
A[n_,k_]:=If[k==0,10n,n*10^(Floor[Log10[k]]+1)+k]; Table[A[n-k,k],{n,0,11},{k,0,n}]//Flatten

T(n, k) = fromdigits(concat(digits(n), digits(k))); \\ Michel Marcus, Jul 06 2025

A(n,0) = 10*n and A(n,k) = n*10^(floor(log_10(k)) + 1) + k for k > 0.

A017356 a(n) = (10*n+7)^4.

Original entry on oeis.org

2401, 83521, 531441, 1874161, 4879681, 10556001, 20151121, 35153041, 57289761, 88529281, 131079601, 187388721, 260144641, 352275361, 466948881, 607573201, 777796321, 981506241, 1222830961, 1506138481

Offset: 0

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (5, -10, 10, -5, 1).

Cf. A017353.

[(10*n+7)^4: n in [0..40]]; // Vincenzo Librandi, Aug 30 2011

(10 Range[0, 20] + 7)^4 (* Wesley Ivan Hurt, Jan 15 2017 *)

A017360 a(n) = (10*n + 7)^8.

Original entry on oeis.org

5764801, 6975757441, 282429536481, 3512479453921, 23811286661761, 111429157112001, 406067677556641, 1235736291547681, 3282116715437121, 7837433594376961, 17181861798319201, 35114532758015841, 67675234241018881

Offset: 0

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (9, -36, 84, -126, 126, -84, 36, -9, 1).

Cf. A017353 (10*n+7), A001016 (n^8).

[(10*n+7)^8: n in [0..20]]; // Vincenzo Librandi, Aug 30 2011

(10*Range[0,20]+7)^8 (* or *) LinearRecurrence[{9,-36,84,-126,126,-84,36,-9,1},{5764801,6975757441,282429536481,3512479453921,23811286661761,111429157112001,406067677556641,1235736291547681,3282116715437121},20] (* Harvey P. Dale, Aug 25 2012 *)

vector(20, n, n--; (10*n+7)^8) \\ G. C. Greubel, Nov 10 2018

a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) + 36*a(n-7) - 9*a(n-8) + a(n-9); a(0)=5764801, a(1)=6975757441, a(2)=282429536481, a(3)=3512479453921, a(4)=23811286661761, a(5)=111429157112001, a(6)=406067677556641, a(7)=1235736291547681, a(8)=3282116715437121. - Harvey P. Dale, Aug 25 2012

cp's OEIS Frontend

A030432 Primes of form 10n+7.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Sage

Formula

Extensions

A106621 a(n) = numerator of n/(n+20).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A063226 Dimension of the space of weight 2n cuspidal newforms for Gamma_0(63).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A260181 Numbers whose last digit is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

PARI

Formula

A355307 Carmichael numbers ending in 7.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Python

A152161 a(n) = 100*n^2 + 100*n + 21.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A152161 a(n) = 100n^2 + 100n + 21.