A195678 -id:A195678 - cp's OEIS frontend

A002262 Triangle read by rows: T(n,k) = k, 0 <= k <= n, in which row n lists the first n+1 nonnegative integers.

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

Offset: 0

Angele Hamel (amh(AT)maths.soton.ac.uk)

The point with coordinates (x = A025581(n), y = A002262(n)) sweeps out the first quadrant by upwards antidiagonals. N. J. A. Sloane, Jul 17 2018
Old name: Integers 0 to n followed by integers 0 to n+1 etc.
a(n) = n - the largest triangular number <= n. - Amarnath Murthy, Dec 25 2001
The PARI functions t1, t2 can be used to read a square array T(n,k) (n >= 0, k >= 0) by antidiagonals downwards: n -> T(t1(n), t2(n)). - Michael Somos, Aug 23 2002
Values x of unique solution pair (x,y) to equation T(x+y) + x = n, where T(k)=A000217(k). - Lekraj Beedassy, Aug 21 2004
a(A000217(n)) = 0; a(A000096(n)) = n. - Reinhard Zumkeller, May 20 2009
Concatenation of the set representation of ordinal numbers, where the n-th ordinal number is represented by the set of all ordinals preceding n, 0 being represented by the empty set. - Daniel Forgues, Apr 27 2011
An integer sequence is nonnegative if and only if it is a subsequence of this sequence. - Charles R Greathouse IV, Sep 21 2011
a(A195678(n)) = A000040(n) and a(m) <> A000040(n) for m < A195678(n), an example of the preceding comment. - Reinhard Zumkeller, Sep 23 2011
A sequence B is called a reluctant sequence of sequence A, if B is triangle array read by rows: row number k coincides with first k elements of the sequence A. A002262 is reluctant sequence of 0,1,2,3,... The nonnegative integers, A001477. - Boris Putievskiy, Dec 12 2012

			From _Daniel Forgues_, Apr 27 2011: (Start)
Examples of set-theoretic representation of ordinal numbers:
  0: {}
  1: {0} = {{}}
  2: {0, 1} = {0, {0}} = {{}, {{}}}
  3: {0, 1, 2} = {{}, {0}, {0, 1}} = ... = {{}, {{}}, {{}, {{}}}} (End)
From _Omar E. Pol_, Jul 15 2012: (Start)
  0;
  0, 1;
  0, 1, 2;
  0, 1, 2, 3;
  0, 1, 2, 3, 4;
  0, 1, 2, 3, 4, 5;
  0, 1, 2, 3, 4, 5, 6;
  0, 1, 2, 3, 4, 5, 6, 7;
  0, 1, 2, 3, 4, 5, 6, 7, 8;
  0, 1, 2, 3, 4, 5, 6, 7, 8, 9;
  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
(End)

Charles R Greathouse IV, Rows n = 0..100, flattened
Boris Putievskiy, Transformations [Of] Integer Sequences And Pairing Functions, arXiv preprint arXiv:1212.2732 [math.CO], 2012.
Michael Somos, Sequences used for indexing triangular or square arrays

Cf. A002024, A002260, A004736, A025581, A025675, A025682.
Cf. A025691, A048645, A053186, A053645, A056558, A127324.
As a sequence, essentially same as A048151.
Cf. A060510 (parity).

a002262 n k = a002262_tabl !! n !! k
a002262_row n = a002262_tabl !! n
a002262_tabl = map (enumFromTo 0) [0..]
a002262_list = concat a002262_tabl
-- Reinhard Zumkeller, Aug 05 2015, Jul 13 2012, Mar 07 2011

seq(seq(i,i=0..n),n=0..14); # Peter Luschny, Sep 22 2011
A002262 := n -> n - binomial(floor((1/2)+sqrt(2*(1+n))),2);

m[n_]:= Floor[(-1 + Sqrt[8n - 7])/2]
b[n_]:= n - m[n] (m[n] + 1)/2
Table[m[n], {n, 1, 105}]     (* A003056 *)
Table[b[n], {n, 1, 105}]     (* A002260 *)
Table[b[n] - 1, {n, 1, 120}] (* A002262 *)
(* Clark Kimberling, Jun 14 2011 *)
Flatten[Table[k, {n, 0, 14}, {k, 0, n}]] (* Alonso del Arte, Sep 21 2011 *)
Flatten[Table[Range[0,n], {n,0,15}]] (* Harvey P. Dale, Jan 31 2015 *)

PARI
```
a(n)=n-binomial(round(sqrt(2+2*n)),2)
```

t1(n)=n-binomial(floor(1/2+sqrt(2+2*n)),2) /* A002262, this sequence */

t2(n)=binomial(floor(3/2+sqrt(2+2*n)),2)-(n+1) /* A025581, cf. comment by Somos for reading arrays by antidiagonals */

concat(vector(15,n,vector(n,i,i-1)))  \\ M. F. Hasler, Sep 21 2011

apply( {A002262(n)=n-binomial(sqrtint(8*n+8)\/2,2)}, [0..99]) \\ M. F. Hasler, Oct 20 2022

for i in range(16):
    for j in range(i):
        print(j, end=", ") # Mohammad Saleh Dinparvar, May 13 2020

from math import comb, isqrt
def a(n): return n - comb((1+isqrt(8+8*n))//2, 2)
print([a(n) for n in range(105)]) # Michael S. Branicky, May 07 2023

a(n) = A002260(n) - 1.
a(n) = n - (trinv(n)*(trinv(n)-1))/2; trinv := n -> floor((1+sqrt(1+8*n))/2) (cf. A002024); # gives integral inverses of triangular numbers
a(n) = n - A000217(A003056(n)) = n - A057944(n). - Lekraj Beedassy, Aug 21 2004
a(n) = A140129(A023758(n+2)). - Reinhard Zumkeller, May 14 2008
a(n) = f(n,1) with f(n,m) = if nReinhard Zumkeller, May 20 2009
a(n) = (1/2)*(t - t^2 + 2*n), where t = floor(sqrt(2*n+1) + 1/2) = round(sqrt(2*n+1)). - Ridouane Oudra, Dec 01 2019
a(n) = ceiling((-1 + sqrt(9 + 8*n))/2) * (1 - ((1/2)*ceiling((1 + sqrt(9 + 8*n))/2))) + n. - Ryan Jean, Sep 03 2022
G.f.: x*y/((1 - x)*(1 - x*y)^2). - Stefano Spezia, Feb 21 2024

New name from Omar E. Pol, Jul 15 2012

Typo in definition fixed by Reinhard Zumkeller, Aug 05 2015

A034953 Triangular numbers (A000217) with prime indices.

Original entry on oeis.org

3, 6, 15, 28, 66, 91, 153, 190, 276, 435, 496, 703, 861, 946, 1128, 1431, 1770, 1891, 2278, 2556, 2701, 3160, 3486, 4005, 4753, 5151, 5356, 5778, 5995, 6441, 8128, 8646, 9453, 9730, 11175, 11476, 12403, 13366, 14028, 15051, 16110, 16471, 18336, 18721, 19503

Offset: 1

Patrick De Geest, Oct 15 1998

The following sequences (allowing offset of first term) all appear to have the same parity: A034953, triangular numbers with prime indices; A054269, length of period of continued fraction for sqrt(p), p prime; A082749, difference between the sum of next prime(n) natural numbers and the sum of next n primes; A006254, numbers n such that 2n-1 is prime; A067076, 2n+3 is a prime. - Jeremy Gardiner, Sep 10 2004
Given a rectangular prism with sides 1, p, p^2 for p = n-th prime (n > 1), the area of the six sides divided by the volume gives a remainder which is 4*a(n). - J. M. Bergot, Sep 12 2011
The infinite sum over the reciprocals is given by 2*A179119. - Wolfdieter Lang, Jul 10 2019

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Triangular Number.

Cf. A000217, A034954, A034955, A011756, A179119, A195678, A307868.

Cf. A054269, A067076, A082749.

a034953 n = a034953_list !! (n-1)
a034953_list = map a000217 a000040_list
-- Reinhard Zumkeller, Sep 23 2011

a:= n-> (p-> p*(p+1)/2)(ithprime(n)):
seq(a(n), n=1..65);  # Alois P. Heinz, Apr 20 2022

t[n_] := n(n + 1)/2; Table[t[Prime[n]], {n, 44}] (* Robert G. Wilson v, Aug 12 2004 *)
(#(# + 1))/2&/@Prime[Range[50]] (* Harvey P. Dale, Feb 27 2012 *)
With[{nn=200},Pick[Accumulate[Range[nn]],Table[If[PrimeQ[n],1,0],{n,nn}],1]] (* Harvey P. Dale, Mar 05 2023 *)

forprime(p=2,1e3,print1(binomial(p+1,2)", ")) \\ Charles R Greathouse IV, Jul 19 2011

apply(n->binomial(n+1,2),primes(100)) \\ Charles R Greathouse IV, Jun 04 2013

a(n) = A000217(A000040(n)). - Omar E. Pol, Jul 27 2009
a(n) = Sum_{k=1..prime(n)} k. - Wesley Ivan Hurt, Apr 27 2021
Product_{n>=1} (1 - 1/a(n)) = A307868. - Amiram Eldar, Nov 07 2022

A011756 a(n) = prime(n*(n+1)/2).

Original entry on oeis.org

2, 5, 13, 29, 47, 73, 107, 151, 197, 257, 317, 397, 467, 571, 659, 769, 883, 1019, 1151, 1291, 1453, 1607, 1783, 1987, 2153, 2371, 2593, 2791, 3037, 3307, 3541, 3797, 4073, 4357, 4657, 4973, 5303, 5641, 5939, 6301, 6679, 7019, 7477

Offset: 1

Jeff Burch

nonn

There are n distinct successive primes p (not appearing in the sequence) such that a(n) < p < a(n+1). - David James Sycamore, Jul 22 2018

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Triangular Number.

Primes in leading diagonal of triangle in A078721.
Cf. A000040, A000217, A034953.
Cf. A195678.
Cf. A000720.

a011756 n = a011756_list !! (n-1)
a011756_list = map a000040 $ tail a000217_list
-- Reinhard Zumkeller, Sep 23 2011

[NthPrime(n*(n+1) div 2): n in [1..100] ]; // Vincenzo Librandi, Apr 11 2011

seq(ithprime(n*(n+1)/2),n=1..50); # Muniru A Asiru, Jul 22 2018

Prime[#]&/@Accumulate[Range[50]] (* Harvey P. Dale, Mar 23 2015 *)

a(n) = prime(n*(n+1)/2); \\ Michel Marcus, Jul 22 2018

a(n) is asymptotic to (n*(n+1)/2) * log(n*(n+1)/2) = (n*(n+1)/2) * (log(n)+log(n+1)-log(2)) ~ (n^2 + n)*(2 log n)/2 ~ (n^2 + n)*(log n). - Jonathan Vos Post, Mar 12 2006

a(n) = A000040(A000217(n)). - David James Sycamore, Sep 03 2024

cp's OEIS Frontend

A002262 Triangle read by rows: T(n,k) = k, 0 <= k <= n, in which row n lists the first n+1 nonnegative integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

PARI

PARI

Python

Python

Formula

Extensions

A034953 Triangular numbers (A000217) with prime indices.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Formula

A011756 a(n) = prime(n*(n+1)/2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Formula

A195740 Smallest possible largest number of a 5 by n average array where repetitions are allowed with diagonals.

Views

Author

Keywords

Comments

Links

Crossrefs