Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140194
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140194 Same as A140191 except here e=7. +0
1
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 2, 3, 3, 5, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 3, 1, 1, 3, 5, 1, 2, 1, 3, 1, 3, 1, 5, 2, 3, 3, 5, 3, 5, 5, 10, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 2, 3, 5, 1, 1, 1, 1, 2, 3, 3, 5, 1, 1, 1, 2, 3, 5, 5, 9, 1, 1, 2, 3, 1, 1, 3, 5, 1 (list; graph; listen)
OFFSET

0,8

LINKS

Nadia Heninger and N. J. A. Sloane, Table of n, a(n) for n = 0..3000

PROGRAM

See link in A140191 for Fortran program.

CROSSREFS

Adjacent sequences: A140191 A140192 A140193 this_sequence A140195 A140196 A140197

Sequence in context: A057872 A053632 A124060 this_sequence A003989 A091255 A135303

KEYWORD

nonn

AUTHOR

Nadia Heninger (nadiah(AT)cs.princeton.edu) and njas, Jun 06 2008

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 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research