Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003160
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003160 a(1)=a(2)=1, a(n)=n-a(a(n-1))-a(a(n-2)).
(Formerly M0446)
+0
4
1, 1, 1, 2, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 9, 9, 9, 10, 11, 12, 12, 12, 13, 14, 15, 15, 15, 16, 16, 16, 17, 17, 17, 18, 19, 20, 20, 20, 21, 21, 21, 22, 22, 22, 23, 24, 25, 25, 25, 26, 26, 26, 27, 27, 27, 28, 29, 30, 30, 30, 31, 32, 33, 33, 33, 34, 35, 36, 36, 36, 37, 37, 37, 38 (list; graph; listen)
OFFSET

1,4

REFERENCES

L. Carlitz, R. Scoville and V. E. Hoggatt, Jr., Representations for a special sequence, Fib. Quart., 10 (1972), 499-518, 550.

FORMULA

a(n) is asymptotic to n/2.

PROGRAM

(PARI) a(n)=if(n<3, 1, n-a(a(n-1))-a(a(n-2)))

CROSSREFS

Cf. A005206.

Sequence in context: A087793 A030411 A132913 this_sequence A060740 A123273 A073425

Adjacent sequences: A003157 A003158 A003159 this_sequence A003161 A003162 A003163

KEYWORD

nonn

AUTHOR

njas

EXTENSIONS

Edited by Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 01 2003

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research