Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081290
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081290 a(n) = minimal i such that A081289(i) >= A081289(n). +0
4
0, 1, 2, 2, 2, 5, 5, 5, 5, 5, 5, 5, 5, 5, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42 (list; graph; listen)
OFFSET

0,3

COMMENT

After n>0, A000108(n) occurs A000245(n) times.

FORMULA

a(0) = 0, a(n) = A000108(A081288(n)-1)

CROSSREFS

Cf. A072643.

Adjacent sequences: A081287 A081288 A081289 this_sequence A081291 A081292 A081293

Sequence in context: A058704 A098101 A105960 this_sequence A123081 A020917 A035643

KEYWORD

nonn

AUTHOR

Antti Karttunen (Firstname.Surname(AT)iki.fi) Mar 17 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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research