A132292 -id:A132292 - cp's OEIS frontend

A004526 Nonnegative integers repeated, floor(n/2).

0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36

Offset: 0

N. J. A. Sloane

Number of elements in the set {k: 1 <= 2k <= n}.
Dimension of the space of weight 2n+4 cusp forms for Gamma_0(2).
Dimension of the space of weight 1 modular forms for Gamma_1(n+1).
Number of ways 2^n is expressible as r^2 - s^2 with s > 0. Proof: (r+s) and (r-s) both should be powers of 2, even and distinct hence a(2k) = a(2k-1) = (k-1) etc. - Amarnath Murthy, Sep 20 2002
Lengths of sides of Ulam square spiral; i.e., lengths of runs of equal terms in A063826. - Donald S. McDonald, Jan 09 2003
Number of partitions of n into two parts. A008619 gives partitions of n into at most two parts, so A008619(n) = a(n) + 1 for all n >= 0. Partial sums are A002620 (Quarter-squares). - Rick L. Shepherd, Feb 27 2004
a(n+1) is the number of 1's in the binary expansion of the Jacobsthal number A001045(n). - Paul Barry, Jan 13 2005
Number of partitions of n+1 into two distinct (nonzero) parts. Example: a(8) = 4 because we have [8,1],[7,2],[6,3] and [5,4]. - Emeric Deutsch, Apr 14 2006
Complement of A000035, since A000035(n)+2*a(n) = n. Also equal to the partial sums of A000035. - Hieronymus Fischer, Jun 01 2007
Number of binary bracelets of n beads, two of them 0. For n >= 2, a(n-2) is the number of binary bracelets of n beads, two of them 0, with 00 prohibited. - Washington Bomfim, Aug 27 2008
Let A be the Hessenberg n X n matrix defined by: A[1,j] = j mod 2, A[i,i]:=1, A[i,i-1] = -1, and A[i,j] = 0 otherwise. Then, for n >= 1, a(n+1) = (-1)^n det(A). - Milan Janjic, Jan 24 2010
From Clark Kimberling, Mar 10 2011: (Start)
Let RT abbreviate rank transform (A187224). Then
RT(this sequence) = A187484;
RT(this sequence without 1st term) = A026371;
RT(this sequence without 1st 2 terms) = A026367;
RT(this sequence without 1st 3 terms) = A026363. (End)
The diameter (longest path) of the n-cycle. - Cade Herron, Apr 14 2011
For n >= 3, a(n-1) is the number of two-color bracelets of n beads, three of them are black, having a diameter of symmetry. - Vladimir Shevelev, May 03 2011
Pelesko (2004) refers erroneously to this sequence instead of A008619. - M. F. Hasler, Jul 19 2012
Number of degree 2 irreducible characters of the dihedral group of order 2(n+1). - Eric M. Schmidt, Feb 12 2013
For n >= 3 the sequence a(n-1) is the number of non-congruent regions with infinite area in the exterior of a regular n-gon with all diagonals drawn. See A217748. - Martin Renner, Mar 23 2013
a(n) is the number of partitions of 2n into exactly 2 even parts. a(n+1) is the number of partitions of 2n into exactly 2 odd parts. This just rephrases the comment of E. Deutsch above. - Wesley Ivan Hurt, Jun 08 2013
Number of the distinct rectangles and square in a regular n-gon is a(n/2) for even n and n >= 4. For odd n, such number is zero, see illustration in link. - Kival Ngaokrajang, Jun 25 2013
x-coordinate from the image of the point (0,-1) after n reflections across the lines y = n and y = x respectively (alternating so that one reflection is applied on each step): (0,-1) -> (0,1) -> (1,0) -> (1,2) -> (2,1) -> (2,3) -> ... . - Wesley Ivan Hurt, Jul 12 2013
a(n) is the number of partitions of 2n into exactly two distinct odd parts. a(n-1) is the number of partitions of 2n into exactly two distinct even parts, n > 0. - Wesley Ivan Hurt, Jul 21 2013
a(n) is the number of permutations of length n avoiding 213, 231 and 312, or avoiding 213, 312 and 321 in the classical sense which are breadth-first search reading words of increasing unary-binary trees. For more details, see the entry for permutations avoiding 231 at A245898. - Manda Riehl, Aug 05 2014
Also a(n) is the number of different patterns of 2-color, 2-partition of n. - Ctibor O. Zizka, Nov 19 2014
Minimum in- and out-degree for a directed K_n (see link). - Jon Perry, Nov 22 2014
a(n) is also the independence number of the triangular graph T(n). - Luis Manuel Rivera Martínez, Mar 12 2015
For n >= 3, a(n+4) is the least positive integer m such that every m-element subset of {1,2,...,n} contains distinct i, j, k with i + j = k (equivalently, with i - j = k). - Rick L. Shepherd, Jan 24 2016
More generally, the ordinary generating function for the integers repeated k times is x^k/((1 - x)(1 - x^k)). - Ilya Gutkovskiy, Mar 21 2016
a(n) is the number of numbers of the form F(i)*F(j) between F(n+3) and F(n+4), where 2 < i < j and F = A000045 (Fibonacci numbers). - Clark Kimberling, May 02 2016
The arithmetic function v_2(n,2) as defined in A289187. - Robert Price, Aug 22 2017
a(n) is also the total domination number of the (n-3)-gear graph. - Eric W. Weisstein, Apr 07 2018
Consider the numbers 1, 2, ..., n; a(n) is the largest integer t such that these numbers can be arranged in a row so that all consecutive terms differ by at least t. Example: a(6) = a(7) = 3, because of respectively (4, 1, 5, 2, 6, 3) and (1, 5, 2, 6, 3, 7, 4) (see link BMO - Problem 2). - Bernard Schott, Mar 07 2020
a(n-1) is also the number of integer-sided triangles whose sides a < b < c are in arithmetic progression with a middle side b = n (see A307136). Example, for b = 4, there exists a(3) = 1 such triangle corresponding to Pythagorean triple (3, 4, 5). For the triples, miscellaneous properties and references, see A336750. - Bernard Schott, Oct 15 2020
For n >= 1, a(n-1) is the greatest remainder on division of n by any k in 1..n. - David James Sycamore, Sep 05 2021
Number of incongruent right triangles that can be formed from the vertices of a regular n-gon is given by a(n/2) for n even. For n odd such number is zero. For a regular n-gon, the number of incongruent triangles formed from its vertices is given by A069905(n). The number of incongruent acute triangles is given by A005044(n). The number of incongruent obtuse triangles is given by A008642(n-4) for n > 3 otherwise 0, with offset 0. - Frank M Jackson, Nov 26 2022
The inverse binomial transform is 0, 0, 1, -2, 4, -8, 16, -32, ... (see A122803). - R. J. Mathar, Feb 25 2023

			G.f. = x^2 + x^3 + 2*x^4 + 2*x^5 + 3*x^6 + 3*x^7 + 4*x^8 + 4*x^9 + 5*x^10 + ...

G. L. Alexanderson et al., The William Powell Putnam Mathematical Competition - Problems and Solutions: 1965-1984, M.A.A., 1985; see Problem A-1 of 27th Competition.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 120, P(n,2).
Graham, Knuth and Patashnik, Concrete Mathematics, Addison-Wesley, NY, 1989, page 77 (partitions of n into at most 2 parts).

David Wasserman, Table of n, a(n) for n = 0..1000
Jonathan Bloom and Nathan McNew, Counting pattern-avoiding integer partitions, arXiv:1908.03953 [math.CO], 2019.
British Mathematical Olympiad, 2011/2012 - Round 1 - Problem 2.
Shalosh B. Ekhad and Doron Zeilberger, In How many ways can I carry a total of n coins in my two pockets, and have the same amount in both pockets?, arXiv:1901.08172 [math.CO], 2019.
Ricardo Gómez Aíza, Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis, arXiv:2402.16111 [math.CO], 2024. See p. 23.
Andreas M. Hinz and Paul K. Stockmeyer, Precious Metal Sequences and Sierpinski-Type Graphs, J. Integer Seq., Vol 25 (2022), Article 22.4.8.
Zachary Hoelscher and Eyvindur Ari Palsson, Counting Restricted Partitions of Integers into Fractions: Symmetry and Modes of the Generating Function and a Connection to omega(t), arXiv:2011.14502 [math.NT], 2020.
Kival Ngaokrajang, The distinct rectangles and square in a regular n-gon for n = 4..18.
John A. Pelesko, Generalizing the Conway-Hofstadter $10,000 Sequence, Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.5.
Jon Perry, Square of a directed graph.
William A. Stein, Dimensions of the spaces S_k(Gamma_0(N)).
William A. Stein, The modular forms database.
Eric Weisstein's World of Mathematics, Gear Graph.
Eric Weisstein's World of Mathematics, Prime Partition
Eric Weisstein's World of Mathematics, Total Domination Number.
Index entries for "core" sequences
Index to sequences related to Olympiads
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

a(n+2) = A008619(n). See A008619 for more references.
A001477(n) = a(n+1)+a(n). A000035(n) = a(n+1)-A002456(n).
a(n) = A008284(n, 2), n >= 1.
Zero followed by the partial sums of A000035.
Column 2 of triangle A094953. Second row of A180969.
Cf. A002264, A002265, A002266, A010761, A010762, A110532, A110533.
Partial sums: A002620. Other related sequences: A010872, A010873, A010874.
Cf. similar sequences of the integers repeated k times: A001477 (k = 1), this sequence (k = 2), A002264 (k = 3), A002265 (k = 4), A002266 (k = 5), A152467 (k = 6), A132270 (k = 7), A132292 (k = 8), A059995 (k = 10).
Cf. A289187, A139756 (binomial transf).
Cf. A307136, A336750.

a004526 = (`div` 2)
a004526_list = concatMap (\x -> [x, x]) [0..]
-- Reinhard Zumkeller, Jul 27 2012

[Floor(n/2): n in [0..100]]; // Vincenzo Librandi, Nov 19 2014

A004526 := n->floor(n/2); seq(floor(i/2),i=0..50);

Table[(2n - 1)/4 + (-1)^n/4, {n, 0, 70}] (* Stefan Steinerberger, Apr 02 2006 *)
f[n_] := If[OddQ[n], (n - 1)/2, n/2]; Array[f, 74, 0] (* Robert G. Wilson v, Apr 20 2012 *)
With[{c=Range[0,40]},Riffle[c,c]] (* Harvey P. Dale, Aug 26 2013 *)
CoefficientList[Series[x^2/(1 - x - x^2 + x^3), {x, 0, 75}], x] (* Robert G. Wilson v, Feb 05 2015 *)
LinearRecurrence[{1, 1, -1}, {0, 0, 1}, 75] (* Robert G. Wilson v, Feb 05 2015 *)
Floor[Range[0, 40]/2] (* Eric W. Weisstein, Apr 07 2018 *)

makelist(floor(n/2),n,0,50); /* Martin Ettl, Oct 17 2012 */

a(n)=n\2 /* Jaume Oliver Lafont, Mar 25 2009 */

x='x+O('x^100); concat([0, 0], Vec(x^2/((1+x)*(x-1)^2))) \\ Altug Alkan, Mar 21 2016

def a(n): return n//2
print([a(n) for n in range(74)]) # Michael S. Branicky, Apr 30 2022

def a(n) : return( dimension_cusp_forms( Gamma0(2), 2*n+4) ); # Michael Somos, Jul 03 2014

def a(n) : return( dimension_modular_forms( Gamma1(n+1), 1) ); # Michael Somos, Jul 03 2014

G.f.: x^2/((1+x)*(x-1)^2).
a(n) = floor(n/2).
a(n) = ceiling((n+1)/2). - Eric W. Weisstein, Jan 11 2024
a(n) = 1 + a(n-2).
a(n) = a(n-1) + a(n-2) - a(n-3).
a(2*n) = a(2*n+1) = n.
a(n+1) = n - a(n). - Henry Bottomley, Jul 25 2001
For n > 0, a(n) = Sum_{i=1..n} (1/2)/cos(Pi*(2*i-(1-(-1)^n)/2)/(2*n+1)). - Benoit Cloitre, Oct 11 2002
a(n) = (2*n-1)/4 + (-1)^n/4; a(n+1) = Sum_{k=0..n} k*(-1)^(n+k). - Paul Barry, May 20 2003
E.g.f.: ((2*x-1)*exp(x) + exp(-x))/4. - Paul Barry, Sep 03 2003
G.f.: (1/(1-x)) * Sum_{k >= 0} t^2/(1-t^4) where t = x^2^k. - Ralf Stephan, Feb 24 2004
a(n+1) = A000120(A001045(n)). - Paul Barry, Jan 13 2005
a(n) = (n-(1-(-1)^n)/2)/2 = (1/2)*(n-|sin(n*Pi/2)|). Likewise: a(n) = (n-A000035(n))/2. Also: a(n) = Sum_{k=0..n} A000035(k). - Hieronymus Fischer, Jun 01 2007
The expression floor((x^2-1)/(2*x)) (x >= 1) produces this sequence. - Mohammad K. Azarian, Nov 08 2007; corrected by M. F. Hasler, Nov 17 2008
a(n+1) = A002378(n) - A035608(n). - Reinhard Zumkeller, Jan 27 2010
a(n+1) = A002620(n+1) - A002620(n) = floor((n+1)/2)*ceiling((n+1)/2) - floor(n^2/4). - Jonathan Vos Post, May 20 2010
For n >= 2, a(n) = floor(log_2(2^a(n-1) + 2^a(n-2))). - Vladimir Shevelev, Jun 22 2010
a(n) = A180969(2,n). - Adriano Caroli, Nov 24 2010
A001057(n-1) = (-1)^n*a(n), n > 0. - M. F. Hasler, Jul 19 2012
a(n) = A008615(n) + A002264(n). - Reinhard Zumkeller, Apr 28 2014
Euler transform of length 2 sequence [1, 1]. - Michael Somos, Jul 03 2014

Partially edited by Joerg Arndt, Mar 11 2010, and M. F. Hasler, Jul 19 2012

A057360 a(n) = floor(3*n/8).

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 15, 15, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 21, 21, 21, 22, 22, 22, 23, 23, 24, 24, 24, 25, 25, 25, 26, 26, 27, 27, 27, 28, 28, 28

Offset: 0

Mitch Harris

The cyclic pattern (and numerator of the g.f.) is computed using Euclid's algorithm for GCD.

N. Dershowitz and E. M. Reingold, Calendrical Calculations, Cambridge University Press, 1997.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, NY, 1994.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
N. Dershowitz and E. M. Reingold, Calendrical Calculations Web Site.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,1,-1).

Floors of other ratios: A004526, A002264, A002265, A004523, A057353, A057354, A057355, A057356, A057357, A057358, A057359, A057360, A057361, A057362, A057363, A057364, A057365, A057366, A057367.

Cf. A008585, A032766, A132292.

[Floor(3*n/8): n in [0..80]]; // Vincenzo Librandi, Jul 07 2011

A057360:=n->floor(3*n/8): seq(A057360(n), n=0..100); # Wesley Ivan Hurt, May 15 2015

Floor[3 Range[0, 100]/8] (* Wesley Ivan Hurt, May 15 2015 *)
LinearRecurrence[{1,0,0,0,0,0,0,1,-1},{0,0,0,1,1,1,2,2,3},80] (* Harvey P. Dale, Jan 10 2025 *)

a(n)=3*n>>3 \\ Charles R Greathouse IV, Jul 07 2011

G.f.: x^3*(1+x^3+x^5) / ( (1+x)*(x^2+1)*(x^4+1)*(x-1)^2 ).
From Wesley Ivan Hurt, May 15 2015: (Start)
a(n) = a(n-1)+a(n-8)-a(n-9).
a(n) = A132292(A008585(n)), n>0.
a(n) = A002265(A032766(n)). (End)
Sum_{n>=3} (-1)^(n+1)/a(n) = Pi/(6*sqrt(3)) + log(3)/2. - Amiram Eldar, Sep 30 2022

Numerator of g.f. corrected by R. J. Mathar, Feb 20 2011

A132270 a(n) = floor((n^7-1)/(7*n^6)), which is the same as integers repeated 7 times.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10

Offset: 1

Mohammad K. Azarian, Nov 06 2007

Wolfgang Hornfeck, Chiral spiral cyclic twins. II. A two-parameter family of cyclic twins composed of discrete circle involute spirals, Acta Cryst. (2023) Vol. 79, Part 6, 570-586.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,1,-1).

Cf. A004526 ([n/2]), A002264 ([n/3]), A002265 ([n/4]), A002266 ([n/5]), A054895.
Cf. A152467 ([n/6]), A132292 ([(n-1)/8]).
Cf. A002162.

A132270:=n->floor((n-1)/7); seq(A132270(n), n=1..100); # Wesley Ivan Hurt, Dec 10 2013

Table[Floor[(n - 1)/7], {n, 100}] (* Wesley Ivan Hurt, Dec 10 2013 *)
Table[PadRight[{},7,n],{n,0,10}]//Flatten (* or *) LinearRecurrence[ {1,0,0,0,0,0,1,-1},{0,0,0,0,0,0,0,1},100] (* Harvey P. Dale, Jun 08 2017 *)

a(n)=(n-1)\7 \\ Charles R Greathouse IV, Dec 10 2013

a(n) = floor((n^7-n^6)/(7*n^6-6*n^5)). - Mohammad K. Azarian, Nov 08 2007
G.f.: x^8/(1-x-x^7+x^8). - Robert Israel, Feb 02 2015
a(n) = a(n-1)+a(n-7)-a(n-8). - Wesley Ivan Hurt, May 03 2021
a(n) = floor((n-1)/7). - M. F. Hasler, May 19 2021
Sum_{n>=8} (-1)^n/a(n) = log(2) (A002162). - Amiram Eldar, Sep 30 2022

Offset corrected by Mohammad K. Azarian, Nov 19 2008

A180969 Array read by antidiagonals: a(k,n) = natural numbers each repeated 2^k times.

Original entry on oeis.org

0, 1, 0, 2, 0, 0, 3, 1, 0, 0, 4, 1, 0, 0, 0, 5, 2, 0, 0, 0, 0, 6, 2, 1, 0, 0, 0, 0, 7, 3, 1, 0, 0, 0, 0, 0, 8, 3, 1, 0, 0, 0, 0, 0, 0, 9, 4, 1, 0, 0, 0, 0, 0, 0, 0, 10, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 11, 5, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 12, 5, 2, 1, 0, 0, 0, 0

Offset: 0

Adriano Caroli, Nov 17 2010

Generalization of P. Barry's (2003) formula in A004526.

			Sequence gives the antidiagonals of the infinite square array with rows indexed by k and columns indexed by n:
0  1  2  3  4  5  6  7  8  9 10 11 12 13...
0  0  1  1  2  2  3  3  4  4   5   5   6...
0  0  0  0  1  1  1  1  2  2   2   2   3...
0  0  0  0  0  0  0  0  1  1   1   1   1...
0  0  0  0  0  0  0  0  0  0   0   0   0...
...........................................

Danny Rorabaugh, Table of n, a(n) for n = 0..10000

Cf. A001477, A004526, A002265, A132292.

function v=A180969(k,n,q)
% n=vector of natural numbers 0,1,...,n
% v=vector in which each n is repeated k times
% q=q-th term of v from where to start
if k==0;v=n+q;return;end
v=A180969(k-1,n,q);
% calculate repetition only if v terms are not all zeros
if any(v); v=v/2+((-1).^v-1)/4;end
% Adriano Caroli, Nov 28 2010

Table[Floor[#/2^k] &[n - k], {n, 0, 12}, {k, 0, n}] // Flatten (* Michael De Vlieger, Sep 30 2019 *)

matrix(10, 20, k, n, k--; n--; floor(n/2^k)) \\ Michel Marcus, Sep 09 2019

a(k,n) = (n/2^k) + Sum_{j=1..k} ((-1)^a(j-1,n) - 1)/2^(k-j+2).

a(k,n) = floor(n/2^k). - Adriano Caroli, Sep 30 2019

A120385 If a(n-1) = 1 then largest value so far + 1, otherwise floor(a(n-1)/2); or table T(n,k) with T(n,0) = n, T(n,k+1) = floor(T(n,k)/2).

Original entry on oeis.org

1, 2, 1, 3, 1, 4, 2, 1, 5, 2, 1, 6, 3, 1, 7, 3, 1, 8, 4, 2, 1, 9, 4, 2, 1, 10, 5, 2, 1, 11, 5, 2, 1, 12, 6, 3, 1, 13, 6, 3, 1, 14, 7, 3, 1, 15, 7, 3, 1, 16, 8, 4, 2, 1, 17, 8, 4, 2, 1, 18, 9, 4, 2, 1, 19, 9, 4, 2, 1, 20, 10, 5, 2, 1, 21, 10, 5, 2, 1, 22, 11, 5, 2, 1, 23, 11, 5, 2, 1, 24, 12, 6, 3, 1, 25

Offset: 1

Franklin T. Adams-Watters, Jun 29 2006

Although not strictly a fractal sequence as defined in the Kimberling link, this sequence has many fractal properties. If the first instance of each value is removed, the result is the original sequence with each row repeated twice. Removing all odd-indexed instances of each value does give the original sequence.

			The table starts:
  1;
  2, 1;
  3, 1;
  4, 2, 1;
  5, 2, 1;
  6, 3, 1;
  7, 3, 1;
  8, 4, 2, 1;

Alois P. Heinz, Rows n = 1..2048, flattened
C. Kimberling, Fractal sequences

Cf. A029837 (row lengths), A083652 (position of first n).
Cf. A005187 (row sums). A001477, A050292, A080277.
Cf. A000027, A004526, A002265, A132292.

T:= proc(n) T(n):= `if`(n=1, 1, [n, T(iquo(n, 2))][]) end:
seq(T(n), n=1..30);  # Alois P. Heinz, Feb 12 2019

Flatten[Function[n,NestWhile[Append[#, Floor[Last[#]/2]] &, {n}, Last[#] != 1 &]][#] & /@ Range[50]] (* Birkas Gyorgy, Apr 14 2011 *)

T(n,k) = floor(n/2^(k-1)).
From Peter Bala, Feb 02 2013: (Start)
The n-th row polynomial R(n,t) = Sum_{k>=0} t^k*floor(n/2^k) and satisfies the recurrence equation R(n,t) = t*R(floor(n/2),t) + n, with R(1,t) = 1.
O.g.f. Sum_{n>=1} R(n,t)*x^n = 1/(1-x)*Sum_{n>=0} t^n*x^(2^n)/(1 - x^(2^n)).
Product_{n>=1} ( 1 + x^((t^n - 2^n)/(t-2)) ) = 1 + Sum_{n>=1} x^R(n,t) = 1 + x + x^(2 + t) + x^(3 + t) + x^(4 + 2*t + t^2) + .... For related sequences see A050292 (t = -1), A001477(t = 0), A005187 (t = 1) and A080277 (t = 2).
(End)

A173923 In the sequence of nonnegative integers substitute all n by 2^floor(n/8) occurrences of (n mod 2).

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0

Offset: 0

Reinhard Zumkeller, Mar 04 2010

nonn

a(n) = A173920(n+8,8).

a(n) = A000035(A132292(A030101(n+8)+1)).

Cf. A001477, A079944, A173922.

Table[PadRight[{},2^Floor[n/8],Mod[n,2]],{n,0,30}]//Flatten (* Harvey P. Dale, Aug 07 2021 *)

Sequence definition changed for clarity (see A173922).

A343609 a(n) = floor(n/9).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10

Offset: 0

M. F. Hasler, May 19 2021

Also: Nonnegative integers repeated 9 times (with natural offset 0).

Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,1,-1).

Cf. A004526 ([n/2]), A002264 ([n/3]), A002265 ([n/4]), A002266 ([n/5]), A152467 ([n/6]), A132270 ([(n-1)/7]), A132292 ([(n-1)/8]), A059995 ([n/10]), A344420 ([n/11]), A342696 ([n/12]).

Repunits A002275 = A343609 o A011557.

A343609 := n -> iquo(n,9); # illustration: map( A343609, [$0..99] );

A343609[n_] := Floor[n/9]
a[n_] := Quotient[n, 9]; Array[a, 100, 0] (* Amiram Eldar, May 19 2021 *)
LinearRecurrence[{1,0,0,0,0,0,0,0,1,-1},{0,0,0,0,0,0,0,0,0,1},100] (* Harvey P. Dale, Mar 01 2025 *)

PARI
```
apply( A343609(n)=n\9, [0..99])
```

a(n) = A002264(A002264(n)).
a(n) = a(n-1) + a(n-9) - a(n-10), n > 9;
G.f.: x^9/(1 - x - x^9 + x^10).

cp's OEIS Frontend

A004526 Nonnegative integers repeated, floor(n/2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

PARI

Python

Sage

Sage

Formula

Extensions

A057360 a(n) = floor(3*n/8).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A132270 a(n) = floor((n^7-1)/(7*n^6)), which is the same as integers repeated 7 times.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A180969 Array read by antidiagonals: a(k,n) = natural numbers each repeated 2^k times.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

MATLAB

Mathematica

PARI

Formula

A120385 If a(n-1) = 1 then largest value so far + 1, otherwise floor(a(n-1)/2); or table T(n,k) with T(n,0) = n, T(n,k+1) = floor(T(n,k)/2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A173923 In the sequence of nonnegative integers substitute all n by 2^floor(n/8) occurrences of (n mod 2).

Views

Author

Keywords

Comments