A108967 - OEIS

A108967

This finite sequence is obtained by replacing the letters you are reading now with their rank in the alphabet.

20, 8, 9, 19, 6, 9, 14, 9, 20, 5, 19, 5, 17, 21, 5, 14, 3, 5, 9, 19, 15, 2, 20, 1, 9, 14, 5, 4, 2, 25, 18, 5, 16, 12, 1, 3, 9, 14, 7, 20, 8, 5, 12, 5, 20, 20, 5, 18, 19, 25, 15, 21, 1, 18, 5, 18, 5, 1, 4, 9, 14, 7, 14, 15, 23, 23, 9, 20, 8, 20, 8, 5, 9, 18, 18, 1, 14, 11, 9, 14, 20, 8, 5, 1, 12, 16, 8, 1, 2, 5, 20

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..91.

MATHEMATICA

ToCharacterCode[StringDelete[ToUpperCase["This finite sequence is obtained by replacing the letters you are reading now with their rank in the alphabet"], " "]] - 64 (* Paolo Xausa, Dec 06 2025 *)

PROG

(Python)

print([ord(c.lower())-ord('a')+1 for c in "This finite sequence is obtained by replacing the letters you are reading now with their rank in the alphabet" if c.isalpha()]) # Michael S. Branicky, Dec 06 2025

CROSSREFS

Sequence in context: A102409 A334691 A097395 * A097390 A123174 A040384

Adjacent sequences: A108964 A108965 A108966 * A108968 A108969 A108970

KEYWORD

fini,full,nonn,word,dumb,less

AUTHOR

Eric Angelini, Jul 26 2005

EXTENSIONS

Corrected and edited by the author Eric Angelini, Nov 27 2009

Corrected and edited by Andrei Zabolotskii, Dec 05 2025

STATUS

approved