332928

Appears in sequences

• a(n)-th triangular number is a square: a(n+1) = 6*a(n) - a(n-1) + 2, with a(0) = 0, a(1) = 1.at n=8A001108
• Expansion of 1/((1 - x)*(1 - 2*x - x^2)).at n=14A048739
• Numbers k such that k and k+1 are powerful numbers.at n=6A060355
• Powerful numbers of the form k^2 - 1.at n=5A060859
• Number of 15 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.at n=1A069337
• Duplicate of A048739.at n=14A090757
• Expansion of g.f. x/(1 - x - 3*x^2 - x^3).at n=16A097076
• a(n) = 2*A079291(n) (twice squares of Pell numbers).at n=8A114619
• Consider all Pythagorean triples (X,X+1,Z) ordered by increasing Z; sequence gives Z-(X+1) values.at n=7A115598
• X-values of solutions to the equation X*(X + 1) - 8*Y^2 = 0.at n=4A132592
• a(n) = sinh(2*arccosh(n))^2 = 4*n^2*(n^2 - 1).at n=17A173121
• Row sums of A181657.at n=28A181658
• a(n+1) = 4*a(n)*(a(n)+1) for a(0) = 1.at n=3A190840
• (n-1)-st elementary symmetric function of the first n terms of (1,2,1,4,1,6,1,8,...)=(A124625 for n>1).at n=11A203192
• Composite numbers such that product_{i=1..k} (p_i/(p_i-1)) / sum_{i=1..k} (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of n (with multiplicity).at n=24A227034
• Numbers k such that the distance between the k-th triangular number and the nearest square is at most 1.at n=28A229083
• The smaller of a pair of successive powerful numbers (A001694) without any prime number between them.at n=33A240591
• Rectangular array read upwards by columns: T = T(n,k) = number of paths from (0,1) to (n,k), where 0 <= k <= 2, consisting of segments given by the vectors (1,1), (1,0), (1,-1).at n=50A247311
• Numbers n such that 2^n == 1 (mod sigma(n)).at n=41A278836
• Solutions y to the negative Pell equation y^2 = 72*x^2 - 332928 with x,y >= 0.at n=12A281236