Rayan Ivaturi - cp's OEIS frontend

User: Rayan Ivaturi

Rayan Ivaturi has authored 1 sequences.

A281813 a(0) = 3, a(n) = 8*n + 4 for n > 0.

3, 12, 20, 28, 36, 44, 52, 60, 68, 76, 84, 92, 100, 108, 116, 124, 132, 140, 148, 156, 164, 172, 180, 188, 196, 204, 212, 220, 228, 236, 244, 252, 260, 268, 276, 284, 292, 300, 308, 316, 324, 332, 340, 348, 356, 364, 372, 380, 388, 396, 404

Offset: 0

Rayan Ivaturi, Jan 30 2017

Consider a 1 X S rectangle on an infinite grid and surround it successively with the minimum number of 1 X 1 tiles: the initial S on step 0, 2S + 6 on step 1, 2S + 14 on step 2, and so on. This sequence is case S = 3. See Ivaturi link for a connection to sieving for primes.

Rayan Ivaturi, Ripple Numbers
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A017113.

Other 'ripple sequences': A022144 (s=1), A017089 (s=2).

a(n)=if(n>0, 8*n+4, 3) \\ Charles R Greathouse IV, Feb 07 2017

G.f.: (3 + 6*x - x^2)/(1 - x)^2.
a(n) = A017113(n) for n>0, a(0) = 3.
a(n) = A086570(n+1) for n>=1. - R. J. Mathar, Jun 21 2025

Entry revised by Editors of OEIS, Feb 09 2017

cp's OEIS Frontend

User: Rayan Ivaturi

A281813 a(0) = 3, a(n) = 8*n + 4 for n > 0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

Extensions