Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093505
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093505 a(n) = ceiling(A001969(n)/2 + 1/2). +0
2
1, 2, 3, 3, 5, 5, 6, 8, 9, 9, 10, 12, 12, 14, 15, 15, 17, 17, 18, 20, 20, 22, 23, 23, 24, 26, 27, 27, 29, 29, 30, 32, 33, 33, 34, 36, 36, 38, 39, 39, 40, 42, 43, 43, 45, 45, 46, 48, 48, 50, 51, 51, 53, 53, 54, 56, 57, 57, 58, 60, 60, 62, 63, 63, 65 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = A001969(n) - n + 1 for n >= 2. Sequence (without first term) is inverse (frequency distribution) sequence of A161560. For n >= 2 we have: a(A000069(n-1)+1) = n, otherwise a(n) = n - 1. A000069(n) = odious numbers, A001969(n) = evil numbers.

EXAMPLE

a(5) = 5 because the fifth evil number = 9 and ceiling(9/2 + 1/2) = 5.

CROSSREFS

Cf. A001969.

Sequence in context: A159237 A010761 A161172 this_sequence A146071 A167411 A112823

Adjacent sequences: A093502 A093503 A093504 this_sequence A093506 A093507 A093508

KEYWORD

easy,nonn

AUTHOR

Michael Joseph Halm (hierogamous(AT)lycos.com), May 13 2004

EXTENSIONS

Corrected and edited by Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jun 13 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research