A363659 Numbers k such that the last letter of k is the same as the first letter of k+1 when written in English.

0, 18, 28, 38, 79, 81, 83, 85, 97, 102, 122, 132, 142, 152, 162, 172, 182, 192, 208, 228, 238, 248, 258, 268, 278, 288, 298, 308, 328, 338, 348, 358, 368, 378, 388, 398, 799, 801, 803, 805, 809, 812, 821, 823, 825, 829, 831, 833, 835, 839, 841, 843, 845, 849

Offset

1,2

References

GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See Puzzle 31, page 37.

Links

Michael S. Branicky, Table of n, a(n) for n = 1..10000

Prog

(Python)
from num2words import num2words as n2w
def ok(n): return n2w(n)[-1] == n2w(n+1)[0]
print([k for k in range(850) if ok(k)]) # Michael S. Branicky, Jun 14 2023

Crossrefs

Sequence in context: A141782 A093648 A171221 * A216259 A117101 A063840

Adjacent sequences: A363656 A363657 A363658 * A363660 A363661 A363662

Keyword

nonn,word

Author

Sean A. Irvine, Jun 14 2023

Status

approved