Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105449
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105449 Positive integers whose representation as Roman Fibonacci numbers has exactly four symbols. +0
3
80, 106, 114, 116, 117, 119, 120, 121, 122, 127, 129, 130, 135, 137, 138 (list; graph; listen)
OFFSET

1,1

COMMENT

A105446 gives the number of symbols in Roman Fibonacci numbers. A105447 gives positive integers whose representation as Roman Fibonacci numbers has exactly two symbols. A105448 gives positive integers whose representation as Roman Fibonacci numbers has exactly three symbols. A105450 gives positive integers whose representation as Roman Fibonacci numbers has exactly five symbols.

FORMULA

a(n) is an element of A105449 iff A105446(n) = 4.

EXAMPLE

In Roman Fibonacci number representation:

80 = "DB22", 106 = "EA22", 114 = "DD22", 116 = "DD33", 117 = "DD52", 119 = "DD81", 120 = "DD55", 121 = "DD2A", 122 = "DD1A", 127 = "BF22", 129 = "BF33", 130 = "BF52", 135 = "AF22", 137 = "AF33", 138 = "AF52".

CROSSREFS

Cf. A000045, A006968, A105446-A105448, A105450-A105455.

Sequence in context: A054983 A039545 A143755 this_sequence A043223 A039400 A044003

Adjacent sequences: A105446 A105447 A105448 this_sequence A105450 A105451 A105452

KEYWORD

base,easy,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Apr 09 2005

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research