[go: up one dir, main page]

login
Revision History for A007055 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Let S denote the palindromes in the language {0,1}*; a(n) = number of words of length n in the language SS.
(history; published version)
#63 by OEIS Server at Sun Feb 18 22:57:24 EST 2024
LINKS

Chai Wah Wu, <a href="/A007055/b007055_1.txt">Table of n, a(n) for n = 0..6617</a>

#62 by N. J. A. Sloane at Sun Feb 18 22:57:24 EST 2024
STATUS

proposed

approved

Discussion
Sun Feb 18
22:57
OEIS Server: Installed first b-file as b007055.txt.
#61 by Chai Wah Wu at Sun Feb 18 22:19:26 EST 2024
STATUS

editing

proposed

#60 by Chai Wah Wu at Sun Feb 18 22:19:22 EST 2024
LINKS

Chai Wah Wu, <a href="/A007055/b007055_1.txt">Table of n, a(n) for n = 0..6617</a>

STATUS

approved

editing

#59 by N. J. A. Sloane at Sun Feb 18 12:00:07 EST 2024
STATUS

proposed

approved

#58 by Michel Marcus at Sun Feb 18 11:59:55 EST 2024
STATUS

editing

proposed

#57 by Michel Marcus at Sun Feb 18 11:59:48 EST 2024
LINKS

Chuan Guo, J. Shallit, and A. M. Shur, <a href="http://arxiv.org/abs/1503.09112">On the Combinatorics of Palindromes and Antipalindromes</a>, arXiv preprint arXiv:1503.09112 [cs.FL], 2015.

STATUS

proposed

editing

#56 by Chai Wah Wu at Sun Feb 18 11:57:30 EST 2024
STATUS

editing

proposed

#55 by Chai Wah Wu at Sun Feb 18 11:57:16 EST 2024
PROG

(Python)

from functools import lru_cache

from sympy import totient, proper_divisors

@lru_cache(maxsize=None)

def A007055(n): return (n<<(n+1>>1) if n&1 else 3*n<<(n-2>>1))-sum(totient(n//d)*A007055(d) for d in proper_divisors(n, generator=True)) if n else 1 # Chai Wah Wu, Feb 18 2024

STATUS

approved

editing

#54 by Joerg Arndt at Sat Oct 14 01:42:19 EDT 2017
STATUS

reviewed

approved