A166937 -id:A166937 - cp's OEIS frontend

A166938 Those positive integers that are both in sequence A166936 and in sequence A166937.

2, 10, 12, 20, 26, 38, 40, 42, 52, 56, 58, 68, 77, 84, 89, 104, 106, 110, 116, 137, 138, 142, 145, 149, 150, 154, 166, 168, 169, 170, 174, 178, 196, 204, 212, 220, 232, 234, 240, 268, 275, 277, 285, 291, 299, 300, 308, 315, 333, 336, 337, 339, 340, 348, 357

Offset: 1

Leroy Quet, Oct 24 2009

Each integer in this sequence, when written in binary, contains at least two palindromic substrings that are tied for the longest such substring, obviously.

Cf. A050430, A166936, A166937.

Extended by Ray Chandler, Mar 11 2010

A166936 Positive integers n such that when they are written in binary, the longest palindromic substring (or at least one of which that is tied for longest) in binary n begins and ends with a 0.

Original entry on oeis.org

2, 4, 8, 10, 12, 16, 20, 22, 24, 26, 32, 36, 38, 40, 42, 44, 46, 48, 52, 56, 58, 64, 68, 72, 74, 76, 77, 78, 80, 82, 84, 88, 89, 92, 94, 96, 100, 104, 106, 110, 112, 116, 128, 136, 137, 138, 140, 142, 144, 145, 148, 149, 150, 152, 154, 156, 157, 158, 160, 162, 164

Offset: 1

Leroy Quet, Oct 24 2009

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Cf. A050430, A166937, A166938.

lps0Q[n_]:=Module[{ss=Select[Subsequences[IntegerDigits[n,2]],#==Reverse[#]&],len},len=Max[Length/@ss];AnyTrue[Select[ss,Length[#]==len&],#[[1]]==0&]]; Select[Range[200],lps0Q] (* Harvey P. Dale, Apr 27 2025 *)

Extended by Ray Chandler, Mar 11 2010

cp's OEIS Frontend

A166938 Those positive integers that are both in sequence A166936 and in sequence A166937.

Views

Author

Keywords

Comments

Crossrefs

Extensions

A166936 Positive integers n such that when they are written in binary, the longest palindromic substring (or at least one of which that is tied for longest) in binary n begins and ends with a 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Extensions