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!)
A095945 a(n) = n + number of letters in the English name of n. 0

%I #5 Apr 21 2023 23:45:16

%S 4,4,5,8,8,9,9,12,13,13,13,17,18,21,22,22,23,26,26,27,26,30,31,34,34,

%T 35,35,38,39,39,36,40,41,44,44,45,45,48,49,49,45,49,50,53,53,54,54,57,

%U 58,58,55,59,60,63,63,64,64,67,68,68,65,69,70,73,73,74,74,77,78,78,77

%N a(n) = n + number of letters in the English name of n.

%D GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See pages 49, 79, and 214.

%F a(n) = n + A005589(n)

%K nonn,word

%O 0,1

%A Herman Jamke (hermanjamke(AT)fastmail.fm), Jul 13 2004

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 March 29 05:16 EDT 2024. Contains 371264 sequences. (Running on oeis4.)