458330

Appears in sequences

• a(n) = a(n-1)^2 + 1 for n >= 1, with a(0) = 0.at n=6A003095
• a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)).at n=31A005468
• a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)) for n > 1, a(1) = 2.at n=15A005469
• Smallest number strictly greater than previous one which is the sum of squares of two previous distinct terms (a(1)=1, a(2)=2).at n=12A008318
• Start with 1; square; add 2; subtract 1; repeat.at n=15A059417
• Square array read by antidiagonals with T(n,k)=T(n,k-1)^2+n*T(n,k-1)+1 and T(n,0)=0.at n=21A060136
• Square array read by antidiagonals with T(n,k)=T(n,k-1)^2-n*T(n,k-1)+1 and T(n,0)=0.at n=21A060137
• Erroneous version of A008318.at n=9A064006
• Recursive sequence; one more than maximum of products of pairs of previous terms with indices summing to current index.at n=31A091980
• f-Pascal's triangle where f(n) = n^2 = A000290(n).at n=22A119687
• f-Pascal's triangle where f(n) = n^2 = A000290(n).at n=26A119687
• Numbers of the form q-p, where p and q are prime and q = p^0+p^1+p^2+..+p^k for some k.at n=25A166388
• a(n) = (n^2+1)^2+1.at n=26A178390
• Antidiagonal sums of the convolution array A213566.at n=17A213570
• Numbers m such that sigma(m-1) is a prime.at n=26A270413
• Irregular triangular array, read by rows: row n shows the coefficients of the polynomial p(n,x) defined in Comments.at n=37A329429
• Number of collapsible integer compositions of n.at n=32A353860
• Number of compositions of n into powers of two that each divide the sum of previous powers.at n=32A375492
• Number of compositions of n into powers of two that each divide the sum of previous powers.at n=33A375492