Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015047
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015047 Numbers n such that S(n) = S(n-1) + S(n-2) where S is the Kempner-Smarandache function A002034. +0
1
3, 11, 121, 4902, 26245, 32112, 64010, 368140, 415664, 2091206, 2519648, 4573053, 7783364, 79269727, 136193976, 321022289, 445810543, 559199345, 670994143, 836250239, 893950202, 937203749, 1041478032, 1148788154 (list; graph; listen)
OFFSET

1,1

COMMENT

Also called Smarandache-Fibonacci triples.

REFERENCES

C. Ashbacher and M. Mudge, Personal Computer World, London, #10, 1995, p. 302.

F. Smarandache, Definitions solved and unsolved problems, conjectures and theorems in number theory and geometry, edited by M. Perez, Xiquan Publishing House, 2000.

LINKS

H. Ibstedt, Surfing on the Ocean of Numbers, Erhus Univ. Press, Vail, 1997.

F. Smarandache, Definitions, Solved and Unsolved Problems, Conjectures, ...

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

Cf. A015048, A015049, A015050, A015051, A015052, A015053.

Sequence in context: A131546 A068693 A036930 this_sequence A102847 A113258 A113848

Adjacent sequences: A015044 A015045 A015046 this_sequence A015048 A015049 A015050

KEYWORD

nonn

AUTHOR

R. Muller (Research37(AT)aol.com)

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 4 13:19 EDT 2008. Contains 140839 sequences.


AT&T Labs Research