cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A276583 The infinite trunk of greedy squares beanstalk: The only infinite sequence such that a(n-1) = a(n) - number of squares that sum to a(n) with greedy algorithm (A053610).

Original entry on oeis.org

0, 3, 6, 8, 11, 15, 18, 21, 24, 27, 32, 35, 38, 43, 48, 51, 56, 59, 63, 66, 71, 74, 78, 80, 83, 88, 91, 95, 99, 102, 107, 110, 114, 117, 120, 123, 128, 131, 135, 138, 143, 146, 151, 154, 158, 161, 164, 168, 171, 176, 179, 183, 186, 192, 195, 198, 203, 206, 210, 213, 219, 224, 227, 232, 235, 239, 242, 248, 251, 255
Offset: 0

Views

Author

Antti Karttunen, Sep 07 2016

Keywords

Crossrefs

Cf. A053610, A260740, A276582, A276584, A276585 (first differences).
Cf. also A179016, A259934, A276573, A276613, A276623 for similar constructions.

Programs

Formula

a(n) = A276584(A276582(n)).

A276582 Simple self-inverse permutation of natural numbers: after a(0)=0, list each block of A261224(n) numbers in reverse order, from A261222(n) to A261223(1+n).

Original entry on oeis.org

0, 1, 3, 2, 5, 4, 8, 7, 6, 11, 10, 9, 14, 13, 12, 18, 17, 16, 15, 23, 22, 21, 20, 19, 28, 27, 26, 25, 24, 34, 33, 32, 31, 30, 29, 40, 39, 38, 37, 36, 35, 47, 46, 45, 44, 43, 42, 41, 54, 53, 52, 51, 50, 49, 48, 61, 60, 59, 58, 57, 56, 55, 69, 68, 67, 66, 65, 64, 63, 62, 77, 76, 75, 74, 73, 72, 71, 70, 86, 85, 84, 83, 82, 81, 80, 79, 78
Offset: 0

Views

Author

Antti Karttunen, Sep 07 2016

Keywords

Comments

Maps between A276583 and A276584.

Crossrefs

Programs

Formula

a(0)=0; for n >= 1, a(n) = (A261223(1+A276581(n))- n)+A261222(A276581(n)).
Showing 1-2 of 2 results.