login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010869 Constant sequence: a(n) = 30. 1
30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..53.

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = A007947(A143207(n)). - Reinhard Zumkeller, Sep 13 2011

G.f.: 30/(1-x). - Vincenzo Librandi, Jan 19 2012

MATHEMATICA

Table[30, {60}] (* Vincenzo Librandi, Jan 19 2012 *)

CROSSREFS

Sequence in context: A125564 A056958 A056997 * A078287 A220440 A040871

Adjacent sequences:  A010866 A010867 A010868 * A010870 A010871 A010872

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 21 19:04 EDT 2013. Contains 225504 sequences.