[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A330425 Lexicographically earliest sequence of distinct terms starting with a(1) = 1 ("un") such that the letter count of a(n) + the letter count of a(n+1) = the letter count of [a(n) + a(n+1)]. This is the French version of A330365 (see Crossrefs section). 0
1, 13, 20, 2, 30, 3, 40, 4, 50, 5, 9, 10, 7, 17, 6, 15, 8, 26, 100, 11, 16, 18, 60, 12, 109, 35, 209, 65, 309, 70, 107, 36, 106, 28, 116, 38, 160, 14, 110, 67, 130, 68, 210, 69, 105, 19, 205, 39, 260, 37, 206, 48, 306, 91, 406, 1000, 21, 1100, 22, 2000, 23, 2100, 24, 3000, 25, 3100, 27, 4000, 29, 4100, 31, 5000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Table of n, a(n) for n=1..72.
EXAMPLE
un + treize = quatorze (8 letters on both sides of the equal sign);
treize + vingt = trente-trois (11 letters on both sides);
vingt + deux = vingt-deux (9 letters on both sides);
deux + trente = trente-deux (10 letters on both sides); etc.
CROSSREFS
Cf. A330365 (English original version).
Sequence in context: A343034 A145944 A355964 * A335971 A176150 A095040
Adjacent sequences: A330422 A330423 A330424 * A330426 A330427 A330428
KEYWORD
nonn,word
AUTHOR
Eric Angelini and Jean-Marc Falcoz, Dec 14 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 09:09 EDT 2024. Contains 375511 sequences. (Running on oeis4.)