A277023 a(n) = A276573(A260732(n)); For n >= 1, a(n) = the next larger term right after each (n^2)-1 in the infinite trunk of least squares beanstalk.

0, 3, 6, 11, 16, 27, 38, 51, 64, 83, 102, 123, 144, 171, 198, 227, 256, 291, 326, 361, 400, 444, 486, 531, 576, 627, 678, 731, 786, 843, 902, 963, 1026, 1091, 1158, 1227, 1296, 1371, 1446, 1523, 1600, 1683, 1767, 1851, 1938, 2025, 2118, 2211, 2304, 2403, 2502, 2603, 2706, 2811, 2918, 3027, 3136, 3251, 3366, 3483, 3600, 3723, 3846

Offset: 0

Author

Antti Karttunen, Oct 03 2016

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..750

Crossrefs

Cf. A002828, A260732, A276573.

Cf. A277015 (the positions of squares in this sequence), A277024, A277025 A277026.

Programs

Scheme

(define (A277023 n) (A276573 (A260732 n)))

Formula

a(n) = A276573(A260732(n)).